On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint

DOI10.1016/0012-365X(92)90555-TzbMath0914.90226OpenAlexW4213257218MaRDI QIDQ687374

Alan J. Hoffman

Publication date: 8 December 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90555-t

zbMATH Keywords

coveringshortest pathgreedy algorithmpackingminimum spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (1)

The edge versus path incidence matrix of series-parallel graphs and greedy packing

Cites Work

• Greedy packing and series-parallel graphs
• Totally-Balanced and Greedy Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint