On simple combinatorial optimization problems

A.J. Hoffman

doi:10.1016/0012-365X(92)90555-T

Discrete Mathematics

Paper

01 Sep 1992

On simple combinatorial optimization problems

View publication

Abstract

We characterize (0,1) linear programming matrices for which a greedy algorithm and its dual solve certain covering and packing problems. Special cases are shortest path and minimum spanning tree algorithms. © 1992.

Paper

Restrictions and preassignments in preemptive open shop scheduling

D. De Werra, A.J. Hoffman, et al.

Discrete Applied Mathematics

Paper

On graphs whose least eigenvalue exceeds - 1 - √2

A.J. Hoffman

Linear Algebra and Its Applications

Paper

Eigenvalues and partitionings of the edges of a graph

A.J. Hoffman

Linear Algebra and Its Applications

Paper

On bounds for eigenvalues of real symmetric matrices

E.R. Barnes, A.J. Hoffman

Linear Algebra and Its Applications

View all publications

Abstract

Related

Restrictions and preassignments in preemptive open shop scheduling

On graphs whose least eigenvalue exceeds - 1 - √2

Eigenvalues and partitionings of the edges of a graph

On bounds for eigenvalues of real symmetric matrices