✦ LIBER ✦

Minimum Entropy Combinatorial Optimization Problems

✍ Scribed by Jean Cardinal; Samuel Fiorini; Gwenaël Joret

Book ID: 113023328
Publisher: Springer
Year: 2011
Tongue: English
Weight: 636 KB
Volume: 51
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-011-9371-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Stochastic Minimum Cross-Entropy Metho

A Stochastic Minimum Cross-Entropy Method for Combinatorial Optimization and Rare-event Estimation*

✍ R. Y. Rubinstein 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 339 KB

An ε-approximation scheme for combinator

An ε-approximation scheme for combinatorial optimization problems with minimum variance criterion

✍ Naoki Katoh 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 868 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.

The minimum-entropy set cover problem

✍ Eran Halperin; Richard M. Karp 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Kbest solutions to combinatorial optimiz

Kbest solutions to combinatorial optimization problems

✍ H. W. Hamacher; M. Queyranne 📂 Article 📅 1985 🏛 Springer US 🌐 English ⚖ 1017 KB