✦ LIBER ✦

An Exact Algorithm for the Simplified Multiple Depot Crew Scheduling Problem

✍ Scribed by M.A. Boschetti; A. Mingozzi; S. Ricciardelli

Book ID: 111570843
Publisher: Springer US
Year: 2004
Tongue: English
Weight: 199 KB
Volume: 127
Category: Article
ISSN: 0254-5330
DOI: 10.1023/b:anor.0000019089.86834.91

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An exact algorithm for multiple depot bu

An exact algorithm for multiple depot bus scheduling

✍ M.A. Forbes; J.N. Holt; A.M. Watts 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 660 KB

A branch and bound algorithm for the mul

A branch and bound algorithm for the multiple depot vehicle scheduling problem

✍ G. Carpaneto; M. Dell'amico; M. Fischetti; P. Toth 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 814 KB

An exact algorithm for project schedulin

An exact algorithm for project scheduling with multiple modes

✍ Arno Sprecher; Sönke Hartmann; Andreas Drexl 📂 Article 📅 1997 🏛 Springer 🌐 German ⚖ 965 KB

A tree search algorithm for the crew sch

A tree search algorithm for the crew scheduling problem

✍ J.E. Beasley; B. Cao 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 871 KB

Iterated local search for the multiple d

Iterated local search for the multiple depot vehicle scheduling problem

✍ Benoît Laurent; Jin-Kao Hao 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 500 KB

An exact algorithm for large multiple kn

An exact algorithm for large multiple knapsack problems

✍ David Pisinger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 137 KB

The Multiple Knapsack Problem (MKP) is the problem of assigning a subset of n items to m distinct knapsacks, such that the total pro®t sum of the selected items is maximized, without exceeding the capacity of each of the knapsacks. The problem has several applications in naval as well as ®nancial ma