✦ LIBER ✦

A polyhedral branch-and-cut approach to global optimization

✍ Scribed by Mohit Tawarmalani; Nikolaos V. Sahinidis

Publisher: Springer-Verlag
Year: 2005
Tongue: English
Weight: 253 KB
Volume: 103
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-005-0581-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-reduce-cut algorithm for the gl

A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs

✍ Myun-Seok Cheon; Shabbir Ahmed; Faiz Al-Khayyal 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 292 KB

We consider probabilistically constrained linear programs with general distributions for the uncertain parameters. These problems involve non-convex feasible sets. We develop a branch-and-bound algorithm that searches for a global optimal solution to this problem by successively partitioning the non

A branch and cut approach to the cardina

A branch and cut approach to the cardinality constrained circuit problem

✍ P. Bauer; J.T. Linderoth; M.W.P. Savelsbergh 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 548 KB

Solving Max-Cut to optimality by interse

Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations

✍ Franz Rendl; Giovanni Rinaldi; Angelika Wiegele 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 402 KB

Two-edge connected subgraphs with bounde

Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut

✍ B. Fortz; A. R. Mahjoub; S. T. McCormick; P. Pesneau 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 267 KB

A response-modeling approach to global o

A response-modeling approach to global optimization and OUU

✍ Brian Rutherford 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 814 KB

A Combined Global & Local Search (CGLS)

A Combined Global & Local Search (CGLS) Approach to Global Optimization

✍ U. M. Garcia-Palomares; F. J. Gonzalez-Castaño; J. C. Burguillo-Rial 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 147 KB