Guided dive for the spatial branch-and-bound
type: Item
instance of: scholarly article
title: Guided dive for the spatial branch-and-bound
zbMATH Open document ID: 1379.90028
published in: Journal of Global Optimization
publication date: 2017-11-02T00:00:00Z
full work available at URL: http://orbi.ulg.ac.be/handle/2268/208826
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6802510
zbMATH Keywords: spatial branch-and-bound
zbMATH Keywords: local search
zbMATH Keywords: heuristic
zbMATH Keywords: guided dive
zbMATH Keywords: branching
zbMATH Keywords: Couenne
author: David Gerard
author: Matthias Köppe
author: Quentin Louveaux
describes a project that uses: SCIP
describes a project that uses: ANTIGONE
describes a project that uses: LINDO
describes a project that uses: LINDOGlobal
MaRDI profile type: Publication
OpenAlex ID: W2590825195
cites work: Construction of convex relaxations using automated code generation techniques
cites work: Branching and bounds tighteningtechniques for non-convex MINLP
cites work: A polyhedral branch-and-cut approach to global optimization
cites work: Nonlinear Programming
cites work: Efficient Nonlinear Programming Algorithms for Chemical Process Control and Operations
cites work: Q4840764
cites work: A Trust Region Algorithm for Nonlinearly Constrained Optimization
cites work: The global solver in the LINDO API
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
cites work: Q5588268
cites work: Advanced techniques for clearance of flight control laws
cites work: Local branching
cites work: Nonlinear programming without a penalty function.
cites work: Combinatorial and Continuous Models for the Optimization of Traffic Flows on Networks
cites work: The travelling salesman problem with neighbourhoods: MINLP solution
cites work: Rounding-based heuristics for nonconvex MINLPS
cites work: A recipe for finding good solutions to MINLPs
cites work: Variable neighborhood search
cites work: Q4324980
cites work: Complete search in continuous global optimization and constraint satisfaction
cites work: Q5491447
cites work: Validation of nominations in gas network optimization: models, methods, and solutions
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
DOI: 10.1007/S10898-017-0503-3
description: scientific article; zbMATH DE number 6802510