✦ 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
DOI: 10.1007/bf02022039

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Combinatorial Optimization (Cook/Combina

Combinatorial Optimization (Cook/Combinatorial) || Problems and Algorithms

✍ Cook, William J.; Cunningham, William H.; Pulleyblank, William R.; Schrijver, Al 📂 Article 📅 2011 🏛 John Wiley & Sons, Inc. ⚖ 646 KB

Solution Structure of Some Inverse Combi

Solution Structure of Some Inverse Combinatorial Optimization Problems

✍ Jianzhong Zhang; Zhongfan Ma 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 62 KB

Solution of combinatorial optimization p

Solution of combinatorial optimization problems with minimax criterion

✍ M. K. Kravtsov; A. Kh. Sherman 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 961 KB

Minimum Entropy Combinatorial Optimizati

Minimum Entropy Combinatorial Optimization Problems

✍ Jean Cardinal; Samuel Fiorini; Gwenaël Joret 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 636 KB

Color constrained combinatorial optimiza

Color constrained combinatorial optimization problems

✍ Horst W. Hamacher; Franz Rendl 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 408 KB

On simple combinatorial optimization pro

On simple combinatorial optimization problems

✍ 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.