✦ LIBER ✦

Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem

✍ Scribed by Andreas T. Ernst; Mohan Krishnamoorthy

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 919 KB
Volume: 104
Category: Article
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(96)00340-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heuristics and exact algorithms for solv

Heuristics and exact algorithms for solving the Monden problem

✍ J. Bautista; R. Companys; A. Corominas 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 869 KB

Fast primal and dual heuristics for the

Fast primal and dual heuristics for the p-median location problem

✍ M. Eugénia Captivo 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 577 KB

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

An O(pn2) algorithm for the p-median and

An O(pn2) algorithm for the p-median and related problems on tree graphs

✍ Arie Tamir 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 402 KB