✦ LIBER ✦

Efficiently solvable special cases of hard combinatorial optimization problems

✍ Scribed by Rainer E. Burkard

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficiently solvable special cases of bo

✍ R.E. Burkard; W. Sandholzer 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 892 KB

Solvable cases of a new combinatorial pr

✍ V. Ya. Burdyuk; V. A. Semenov 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 423 KB

Approximability of hard combinatorial op

✍ Francesco Maffioli; Giulia Galbiati 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 124 KB

Polynomially solvable special cases of t

✍ Rainer E. Burkard; Roswitha Rissner 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 442 KB

A well-solvable special case of the boun

✍ Vladimir G. Deineko; Gerhard J. Woeginger 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 196 KB

Polynomially solvable special cases of t

✍ Marshall Bern; Daniel Bienstock 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 985 KB