𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The preemptive swapping problem on a tree

✍ Scribed by Shoshana Anily; Michel Gendreau; Gilbert Laporte

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
237 KB
Volume
58
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A branch-and-cut algorithm for the preem
A branch-and-cut algorithm for the preemptive swapping problem
✍ Charles Bordenave; Michel Gendreau; G. Laporte πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 247 KB πŸ‘ 1 views

## Abstract In the swapping problem (SP), every vertex of a complete graph may supply and demand an object of a known type. A vehicle of unit capacity starting and ending its tour at an arbitrary vertex is available for carrying objects of given types between vertices. The SP consists of determinin

A polynomial algorithm for thep-centdian
A polynomial algorithm for thep-centdian problem on a tree
✍ Tamir, Arie; PοΏ½rez-Brito, Dionisio; Moreno-PοΏ½rez, JosοΏ½ A. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 108 KB πŸ‘ 2 views

The most common problems studied in network location theory are the p-median and the p-center models. The p-median problem on a network is concerned with the location of p points (medians) on the network, such that the total (weighted) distance of all the nodes to their respective nearest points is

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