✦ LIBER ✦

LP based heuristics for the multiple knapsack problem with assignment restrictions

✍ Scribed by Geir Dahl; Njål Foldnes

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 346 KB
Volume: 146
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-006-0048-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heuristic algorithms for the multiple kn

Heuristic algorithms for the multiple knapsack problem

✍ S. Martello; P. Toth 📂 Article 📅 1981 🏛 Springer Vienna 🌐 English ⚖ 835 KB

A parametric-based heuristic program for

A parametric-based heuristic program for the quadratic assignment problem

✍ D. J. White 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 529 KB

A GA Based Heuristic for the Vehicle Rou

A GA Based Heuristic for the Vehicle Routing Problem with Multiple Trips

✍ S. Salhi; R. J. Petch 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 881 KB

A branch-and-bound-based heuristic for s

A branch-and-bound-based heuristic for solving the quadratic assignment problem

✍ M. S. Bazaraa; O. Kirca 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 897 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

Recent Advances for the Quadratic Assign

Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods

✍ Zvi Drezner; Peter M. Hahn; Éeric D. Taillard 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 970 KB