✦ LIBER ✦

The swapping problem

✍ Scribed by S. Anily; R. Hassin

Book ID: 102961641
Publisher: John Wiley and Sons
Year: 1992
Tongue: English
Weight: 703 KB
Volume: 22
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230220408

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Swapping Problem on a Line

✍ Anily, Shoshana; Gendreau, Michel; Laporte, Gilbert 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 145 KB

The preemptive swapping problem on a tre

The preemptive swapping problem on a tree

✍ Shoshana Anily; Michel Gendreau; Gilbert Laporte 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 237 KB 👁 1 views

Dominating problems in swapped networks

✍ Chen, Weidong; Lu, Zaixin; Wu, Weili 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 993 KB

Edge-swapping algorithms for the minimum

Edge-swapping algorithms for the minimum fundamental cycle basis problem

✍ Edoardo Amaldi; Leo Liberti; Francesco Maffioli; Nelson Maculan 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 767 KB

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 branch-and-cut algorithm for the nonpr

A branch-and-cut algorithm for the nonpreemptive swapping problem

✍ Charles Bordenave; Michel Gendreau; Gilbert Laporte 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB 👁 1 views