✦ LIBER ✦

Ad hoc heuristic for the cover printing problem

✍ Scribed by David Romero; Federico Alonso-Pecina

Book ID: 113567724
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 355 KB
Volume: 9
Category: Article
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2011.10.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A heuristic for the label printing probl

A heuristic for the label printing problem

✍ K.F.C. Yiu; K.L. Mak; H.Y.K. Lau 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 498 KB

Simple Lagrangian heuristic for the set

Simple Lagrangian heuristic for the set covering problem

✍ Salim Haddadi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 353 KB

In this paper a simple Lagrangian heuristic is proposed for the set covering problem. It is based on simple and classica1 ideas: Lagrangian duality, greedy heuristic for the set covering problem, subgradient optimization and redundant covers. The main interesting point of the paper lies in the fact

A hybrid heuristic for the set covering

A hybrid heuristic for the set covering problem

✍ Shyam Sundar, Alok Singh 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 802 KB

A Greedy Heuristic for the Set-Covering

A Greedy Heuristic for the Set-Covering Problem

✍ Chvatal, V. 📂 Article 📅 1979 🏛 INFORMS 🌐 English ⚖ 116 KB

A Greedy Heuristic for the Set-Covering

A Greedy Heuristic for the Set-Covering Problem

✍ V. Chvatal 📂 Article 📅 1979 🏛 INFORMS 🌐 English ⚖ 156 KB

A Heuristic Method for the Set Covering

A Heuristic Method for the Set Covering Problem

✍ Alberto Caprara, Matteo Fischetti and Paolo Toth 📂 Article 📅 1999 🏛 INFORMS 🌐 English ⚖ 484 KB