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

Geršgorin variations III: On a theme of Brualdi and Varga

Endre Boros, Richard A. Brualdi, et al.

Linear Algebra and Its Applications

Paper

On eigenvalues of symmetric (+1, -1) matrices

A.J. Hoffman

Israel Journal of Mathematics

Paper

Optimal partitions having disjoint convex and conic hulls

E.R. Barnes, A.J. Hoffman, et al.

Mathematical Programming

Paper

Restrictions and preassignments in preemptive open shop scheduling

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

Discrete Applied Mathematics

View all publications

Abstract

Related

Geršgorin variations III: On a theme of Brualdi and Varga

On eigenvalues of symmetric (+1, -1) matrices

Optimal partitions having disjoint convex and conic hulls

Restrictions and preassignments in preemptive open shop scheduling