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

Optimal partitions having disjoint convex and conic hulls

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

Mathematical Programming

Paper

Bounds for the spectrum of normal matrices

E.R. Barnes, A.J. Hoffman

Linear Algebra and Its Applications

Paper

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

R.A. Brualdi, A.J. Hoffman

Linear Algebra and Its Applications

View all publications

Abstract

Related

Restrictions and preassignments in preemptive open shop scheduling

Optimal partitions having disjoint convex and conic hulls

Bounds for the spectrum of normal matrices

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