Guided dive for the spatial branch-and-bound

DOI10.1007/S10898-017-0503-3MaRDI QIDQ1675571zbMATH OpenOpenAlexFDO

Authors David Gerard, Matthias Köppe, Quentin Louveaux

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

branchingCouenneguided diveheuristiclocal searchspatial branch-and-bound

Mathematics Subject Classification ID

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

Recommendations

• A reduced space branch and bound algorithm for global optimization.
• Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
• scientific article; zbMATH DE number 1054663
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
• Branching and bounds tighteningtechniques for non-convex MINLP

Cites work

• A polyhedral branch-and-cut approach to global optimization
• A recipe for finding good solutions to MINLPs
• A Trust Region Algorithm for Nonlinearly Constrained Optimization
• Advanced techniques for clearance of flight control laws
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Branching and bounds tighteningtechniques for non-convex MINLP
• Combinatorial and Continuous Models for the Optimization of Traffic Flows on Networks
• Complete search in continuous global optimization and constraint satisfaction
• Construction of convex relaxations using automated code generation techniques
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Efficient nonlinear programming algorithms for chemical process control and operations
• Exploring relaxation induced neighborhoods to improve MIP solutions
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 780774 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• Local branching
• Nonlinear Programming
• Nonlinear programming without a penalty function.
• Rounding-based heuristics for nonconvex MINLPS
• The global solver in the LINDO API
• The travelling salesman problem with neighbourhoods: MINLP solution
• Validation of nominations in gas network optimization: models, methods, and solutions
• Variable neighborhood search

Cited in

(3)

• A geometric branch and bound method for robust maximization of convex functions
• 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

Describes a project that uses

Uses Software

• SCIP
• ANTIGONE
• LINDO
• LINDOGlobal

This page was built for publication: Guided dive for the spatial branch-and-bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675571)