Eprint first made available on ORBi (E-prints, working papers and research blog)
Feasibility-oriented Branching Strategies for Global Optimization
Gerard, Damien; Köppe, Matthias; Louveaux, Quentin
2016
 

Files


Full Text
paper.pdf
Author preprint (595.79 kB)
Request a copy

All documents in ORBi are protected by a user license.

Send to



Details



Abstract :
[en] We study the spatial Brand-and-Bound algorithm for the global optimization of nonlinear problems. In particular we are interested in a method to find quickly good feasible solutions. Most spatial Branch-and-Bound-based solvers use a non global solver at a few nodes to try to find better incumbents. We show that it is possible to improve the branching rules and the node priority by exploiting the solutions from the non global solver. We also propose several smart adaptive strategies to choose when to run the non global solver. We show that despite the time spent in solving many more NLP problems in the nodes, the new strategies enable the algorithm to find the first good incumbents faster and to prove the global optimality faster. Numerous easy, medium size as well as hard NLP instances from the Coconut library are benchmarked. All experiments are run using the open source solver Couenne.
Disciplines :
Mathematics
Author, co-author :
Gerard, Damien ;  Université de Liège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Dép. d'électric., électron. et informat. (Inst.Montefiore)
Köppe, Matthias
Louveaux, Quentin ;  Université de Liège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Systèmes et modélisation : Optimisation discrète
Language :
English
Title :
Feasibility-oriented Branching Strategies for Global Optimization
Publication date :
2016
Available on ORBi :
since 11 July 2016

Statistics


Number of views
77 (11 by ULiège)
Number of downloads
9 (4 by ULiège)

Bibliography


Similar publications



Contact ORBi