𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem

✍ Scribed by Sergio García; Mercedes Landete; Alfredo Marín

Book ID
113584042
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
255 KB
Volume
220
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-price algorithm for the cap
A branch-and-price algorithm for the capacitated p-median problem
✍ Alberto Ceselli; Giovanni Righini 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB 👁 1 views

## Abstract The capacitated __p__‐median problem is the variation of the well‐known __p__‐median problem in which a demand is associated to each user, a capacity is associated to each candidate median, and the total demand of the users associated to the same median must not exceed its capacity. We

A branch and cut algorithm for hub locat
A branch and cut algorithm for hub location problems with single assignment
✍ Martine Labbé; Hande Yaman; Eric Gourdin 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 282 KB

The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can tra