𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A tree search algorithm for the p-median problem

✍ Scribed by N. Christofides; J.E. Beasley

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
659 KB
Volume
10
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An improved algorithm for the minmax reg
An improved algorithm for the minmax regret median problem on a tree
✍ Igor Averbakh; Oded Berman πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 116 KB πŸ‘ 1 views

## Abstract We consider the 1‐median problem with uncertain weights for nodes. Specifically, for each node, only an interval estimate of its weight is known. It is required to find a β€œminmax regret” location, that is, to minimize the worst‐case loss in the objective function that may occur because

A tabu search algorithm for the Capacita
A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
✍ Sharaiha, Yazid M.; Gendreau, Michel; Laporte, Gilbert; Osman, Ibrahim H. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 150 KB πŸ‘ 2 views

The Capacitated Shortest Spanning Tree Problem consists of determining a shortest spanning tree in a vertex weighted graph such that the weight of every subtree linked to the root by an edge does not exceed a prescribed capacity. We propose a tabu search heuristic for this problem, as well as dynami

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