Heuristics for convex mixed integer nonlinear programs
From MaRDI portal
Publication:429468
DOI10.1007/s10589-010-9350-6zbMath1241.90189OpenAlexW2091552912MaRDI QIDQ429468
Pierre Bonami, João P. M. Gonçalves
Publication date: 19 June 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-010-9350-6
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Three ideas for a feasibility pump for nonconvex MINLP, A disjunctive cut strengthening technique for convex MINLP, Branch-and-cut for linear programs with overlapping SOS1 constraints, Inexact feasibility pump for mixed integer nonlinear programming, An overview of MINLP algorithms and their implementation in Muriqui optimizer, Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps, A feasible rounding approach for mixed-integer optimization problems, Large-Scale Loan Portfolio Selection, Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization, Inexact solution of NLP subproblems in MINLP, Undercover: a primal MINLP heuristic exploring a largest sub-MIP, Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, Computing feasible points for binary MINLPs with MPECs, Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts, A computational study of primal heuristics inside an MI(NL)P solver, Rounding-based heuristics for nonconvex MINLPS, A primal heuristic for optimizing the topology of gas networks based on dual information, Feasibility pump for aircraft deconfliction with speed regulation, Integrality gap minimization heuristics for binary mixed integer nonlinear programming, RENS. The optimal rounding, Granularity in nonlinear mixed-integer optimization, Ten years of feasibility pump, and counting, An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs, Linearization and parallelization schemes for convex mixed-integer nonlinear optimization, Towards an objective feasibility pump for convex minlps
Uses Software
Cites Work
- An algorithmic framework for convex mixed integer nonlinear programs
- A feasibility pump for mixed integer nonlinear programs
- Feasibility pump 2.0
- Solving mixed integer nonlinear programs by outer approximation
- Local branching
- Exploring relaxation induced neighborhoods to improve MIP solutions
- The feasibility pump
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
