𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Kbest solutions to combinatorial optimization problems

✍ Scribed by H. W. Hamacher; M. Queyranne


Book ID
111868346
Publisher
Springer US
Year
1985
Tongue
English
Weight
1017 KB
Volume
4
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On simple combinatorial optimization pro
✍ A.J. Hoffman πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 228 KB

We characterize (0,l) 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.