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 the Line Graph of the Complete Tripartite Graph

A.J. Hoffman, Basharat A. Jamil

Linear and Multilinear Algebra

Paper

On the spectral radius of (0,1)-matrices

R.A. Brualdi, A.J. Hoffman

Linear Algebra and Its Applications

Paper

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

Endre Boros, Richard A. Brualdi, et al.

Linear Algebra and Its Applications

View all publications

Abstract

Related

Restrictions and preassignments in preemptive open shop scheduling

On the Line Graph of the Complete Tripartite Graph

On the spectral radius of (0,1)-matrices

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