Guided dive for the spatial branch-and-bound

DOI10.1007/s10898-017-0503-3zbMath1379.90028OpenAlexW2590825195MaRDI QIDQ1675571

Quentin Louveaux, David Gerard, Matthias Köppe

Publication date: 2 November 2017

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: http://orbi.ulg.ac.be/handle/2268/208826

zbMATH Keywords

local searchheuristicbranchingspatial branch-and-boundCouenneguided dive

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items

Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems, Solving linear multiplicative programs via branch-and-bound: a computational experience, A geometric branch and bound method for robust maximization of convex functions

Uses Software

• SCIP
• LINDO
• LINDOGlobal
• ANTIGONE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A recipe for finding good solutions to MINLPs
• Variable neighborhood search
• Local branching
• Rounding-based heuristics for nonconvex MINLPS
• Exploring relaxation induced neighborhoods to improve MIP solutions
• A polyhedral branch-and-cut approach to global optimization
• Advanced techniques for clearance of flight control laws
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Construction of convex relaxations using automated code generation techniques
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Validation of nominations in gas network optimization: models, methods, and solutions
• Branching and bounds tighteningtechniques for non-convex MINLP
• The global solver in the LINDO API
• Efficient Nonlinear Programming Algorithms for Chemical Process Control and Operations
• A Trust Region Algorithm for Nonlinearly Constrained Optimization
• The travelling salesman problem with neighbourhoods: MINLP solution
• Nonlinear Programming
• Complete search in continuous global optimization and constraint satisfaction
• Combinatorial and Continuous Models for the Optimization of Traffic Flows on Networks
• Nonlinear programming without a penalty function.