๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization

โœ Scribed by Keha, Ahmet B.; de Farias, Ismael R.; Nemhauser, George L.

Book ID
118217761
Publisher
INFORMS
Year
2006
Tongue
English
Weight
170 KB
Volume
54
Category
Article
ISSN
0030-364X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A branch and cut algorithm for nonconvex
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
โœ Charles Audet; Pierre Hansen; Brigitte Jaumard; Gilles Savard ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 221 KB

We present a branch and cut algorithm that yields in finite time, a globally โ˜ผ-optimal solution (with respect to feasibility and optimality) of the nonconvex quadratically constrained quadratic programming problem. The idea is to estimate all quadratic terms by successive linearizations within a bra

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