✦ LIBER ✦

Branch-and-Cut for the Maximum Feasible Subsystem Problem

✍ Scribed by Pfetsch, Marc E.

Book ID: 118203446
Publisher: Society for Industrial and Applied Mathematics
Year: 2008
Tongue: English
Weight: 202 KB
Volume: 19
Category: Article
ISSN: 1052-6234
DOI: 10.1137/050645828

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the maximum feasible subsystem proble

On the maximum feasible subsystem problem, IISs and IIS-hypergraphs

✍ Edoardo Amaldi; Marc E. Pfetsch; Leslie E. Trotter, Jr. 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 257 KB

A Branch and Cut solver for the maximum

A Branch and Cut solver for the maximum stable set problem

✍ Steffen Rebennack; Marcus Oswald; Dirk Oliver Theis; Hanna Seitz; Gerhard Reinel 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 836 KB

Spectral bounds for the maximum cut prob

Spectral bounds for the maximum cut problem

✍ Walid Ben-Ameur; José Neto 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB

A branch-and-cut algorithm for the Winne

A branch-and-cut algorithm for the Winner Determination Problem

✍ Laureano F. Escudero; Mercedes Landete; Alfredo Marín 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 616 KB

A branch-and-cut method for the obnoxiou

A branch-and-cut method for the obnoxiousp-median problem

✍ Pietro Belotti; Martine Labbé; Francesco Maffioli; Malick M. Ndiaye 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 286 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