✦ LIBER ✦

Variable neighborhood descent heuristic for covering design problem

✍ Scribed by Nebojša Nikolić; Igor Grujičić; Đorđe Dugošija

Book ID: 119236679
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 165 KB
Volume: 39
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2012.10.026

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A variable neighborhood descent heuristi

A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs

✍ Mariam Tagmouti; Michel Gendreau; Jean-Yves Potvin 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 309 KB

A variable neighborhood search heuristic

A variable neighborhood search heuristic for periodic routing problems

✍ Vera C. Hemmelmayr; Karl F. Doerner; Richard F. Hartl 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 366 KB

A variable neighborhood descent heuristi

A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times

✍ Krzysztof Fleszar, Christoforos Charalambous, Khalil S. Hindi 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 356 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 Greedy Heuristic for the Set-Covering

A Greedy Heuristic for the Set-Covering Problem

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

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