✦ LIBER ✦

The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization

✍ Scribed by Michael Jünger; Stefan Thienel

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 209 KB
Volume: 30
Category: Article
ISSN: 0038-0644
DOI: 10.1002/1097-024x(200009)30:11<1325::aid-spe342>3.0.co;2-t

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved branch-and-cut algorithm for

An improved branch-and-cut algorithm for mixed-integer nonlinear systems optimization problem

✍ Yushan Zhu; Yijiong Hu; Hao Wu; Masaru Nakaiwa 📂 Article 📅 2008 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 145 KB 👁 2 views

A branch and cut algorithm for the Stein

A branch and cut algorithm for the Steiner problem in graphs

✍ Lucena, A.; Beasley, J. E. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB 👁 2 views

In this paper, we consider the Steiner problem in graphs, which is the problem of connecting together, at minimum cost, a number of vertices in an undirected graph with nonnegative edge costs. We use the formulation of this problem as a shortest spanning tree (SST) problem with additional constraint