✦ LIBER ✦

A graph theoretical bound for the p-median problem

✍ Scribed by Roberto D. Galvão

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 391 KB
Volume: 6
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(81)90202-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on Galvão's “A graph theoretical

A note on Galvão's “A graph theoretical bound for the p-median problem”

✍ Lutz Morgenstern 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 95 KB

A tree search algorithm for the p-median

A tree search algorithm for the p-median problem

✍ N. Christofides; J.E. Beasley 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 659 KB

Logic vs. complexity theoretic propertie

Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree

✍ Christoph Meinel 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 344 KB

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

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 theoretical analysis of backtracking i

A theoretical analysis of backtracking in the graph coloring problem

✍ Edward A Bender; Herbert S Wilf 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 334 KB