✦ LIBER ✦

The generalized assignment problem: Valid inequalities and facets

✍ Scribed by Elsie Sterbin Gottlieb; M. R. Rao

Publisher: Springer-Verlag
Year: 1990
Tongue: English
Weight: 944 KB
Volume: 46
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01585725

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Valid inequalities and facets of the cap

Valid inequalities and facets of the capacitated plant location problem

✍ Janny M. Y. Leung; Thomas L. Magnanti 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 911 KB

The equipartition polytope. II: Valid in

The equipartition polytope. II: Valid inequalities and facets

✍ Michele Conforti; M. R. Rao; Antonio Sassano 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 798 KB

(1,k)-configuration facets for the gener

(1,k)-configuration facets for the generalized assignment problem

✍ Elsie Sterbin Gottlieb; M. R. Rao 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 294 KB

The bottleneck generalized assignment pr

The bottleneck generalized assignment problem

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 949 KB

Formulations and Valid Inequalities for

Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem

✍ Hande Yaman 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 261 KB

Formulations and Valid Inequalities for

Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem

✍ Hande Yaman 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 261 KB

We consider the vehicle routing problem where one can choose among vehicles with different costs and capacities to serve the trips. We develop six different formulations: the first four based on Miller-Tucker-Zemlin constraints and the last two based on flows. We compare the linear programming bound