✦ LIBER ✦

Constructive heuristics for the canister filling problem

✍ Scribed by Gašper Žerovnik; Janez Žerovnik

Publisher: Springer-Verlag
Year: 2010
Tongue: English
Weight: 457 KB
Volume: 19
Category: Article
ISSN: 1435-246X
DOI: 10.1007/s10100-010-0164-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Constructive heuristic algorithms for th

Constructive heuristic algorithms for the open shop problem

✍ H. Bräsel; T. Tautenhahn; F. Werner 📂 Article 📅 1993 🏛 Springer Vienna 🌐 English ⚖ 698 KB

A new constructive heuristic for the flo

A new constructive heuristic for the flowshop scheduling problem

✍ Christos Koulamas 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 402 KB

Some heuristics for the consensus rankin

Some heuristics for the consensus ranking problem

✍ Michael P. Beck; Benjamin W. Lin 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 589 KB

Heuristics for the fixed cost median pro

Heuristics for the fixed cost median problem

✍ Dorit S. Hochbaum 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 658 KB

A multi-phase constructive heuristic for

A multi-phase constructive heuristic for the vehicle routing problem with multiple trips

✍ R.J Petch; S Salhi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 918 KB

An extension to the classical vehicle routing problem where vehicles can be assigned more than one route within a working time period is investigated. A multi-phase constructive heuristic, which is enhanced by suitable data structure, is proposed. Results are given comparing to benchmarks from the l

Heuristics for the multi-resource genera

Heuristics for the multi-resource generalized assignment problem

✍ Joseph B. Mazzola; Steven P. Wilcox 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB