𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Formulations and valid inequalities for the node capacitated graph partitioning problem

✍ Scribed by C. E. Ferreira; A. Martin; C. C. de Souza; R. Weismantel; L. A. Wolsey

Book ID
110573178
Publisher
Springer-Verlag
Year
1996
Tongue
English
Weight
910 KB
Volume
74
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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