✦ LIBER ✦

A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem

✍ Scribed by Cláudio Alves; J.M. Valério de Carvalho

Book ID: 108105785
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 246 KB
Volume: 35
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2006.08.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Branch-and-Price Algorithms for the One-

Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem

✍ Pamela H. Vance 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 280 KB

A Note on Branch-and-Price Algorithms fo

A Note on Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problems

✍ J.M. Valério de Carvalho 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 46 KB

A branch-and-price algorithm for solving

A branch-and-price algorithm for solving the cutting strips problem

✍ Chen Zhiping; C. A. J. Hurkens; J. L. de Jong 📂 Article 📅 1997 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 528 KB

Branch-and-price-and-cut algorithms for

Branch-and-price-and-cut algorithms for solving the reliableh-paths problem

✍ April K. Andreas; J. Cole Smith; Simge Küçükyavuz 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 397 KB

A branch-and-cut algorithm for multiple

A branch-and-cut algorithm for multiple sequence alignment

✍ Ernst Althaus; Alberto Caprara; Hans-Peter Lenhof; Knut Reinert 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 519 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