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

LaGO: a (heuristic) Branch and Cut algorithm for nonconvex MINLPs

โœ Scribed by Ivo Nowak; Stefan Vigerske

Publisher
Springer-Verlag
Year
2007
Tongue
English
Weight
229 KB
Volume
16
Category
Article
ISSN
1435-246X

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-and-cut algorithm for partition
A branch-and-cut algorithm for partition coloring
โœ Yuri Frota; Nelson Maculan; Thiago F. Noronha; Celso C. Ribeiro ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 294 KB ๐Ÿ‘ 1 views
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