A feasibility pump for mixed integer nonlinear programs
From MaRDI portal
Publication:1013979
DOI10.1007/s10107-008-0212-2zbMath1163.90013OpenAlexW2160783673MaRDI QIDQ1013979
Andrea Lodi, Pierre Bonami, Cornuéjols, Gérard, Margot, François
Publication date: 24 April 2009
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-008-0212-2
Related Items
Three ideas for a feasibility pump for nonconvex MINLP ⋮ A disjunctive cut strengthening technique for convex MINLP ⋮ Inversion of convection-diffusion equation with discrete sources ⋮ Algorithms and Software for Convex Mixed Integer Nonlinear Programs ⋮ Inexact feasibility pump for mixed integer nonlinear programming ⋮ Mixed integer nonlinear programming tools: an updated practical overview ⋮ The supporting hyperplane optimization toolkit for convex MINLP ⋮ Interactive dynamic optimization server – connecting one modelling language with many solvers ⋮ An overview of MINLP algorithms and their implementation in Muriqui optimizer ⋮ A recipe for finding good solutions to MINLPs ⋮ A storm of feasibility pumps for nonconvex MINLP ⋮ Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems ⋮ Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps ⋮ A partial outer convexification approach to control transmission lines ⋮ The Chebyshev center as an alternative to the analytic center in the feasibility pump ⋮ Inexact solution of NLP subproblems in MINLP ⋮ Improving the Randomization Step in Feasibility Pump ⋮ Heuristics for convex mixed integer nonlinear programs ⋮ Combinatorial integral approximation ⋮ Solving Multiobjective Mixed Integer Convex Optimization Problems ⋮ Multidimensional sum-up rounding for integer programming in optimal experimental design ⋮ Undercover: a primal MINLP heuristic exploring a largest sub-MIP ⋮ Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON ⋮ Irreducible infeasible sets in convex mixed-integer programs ⋮ 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 ⋮ Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation ⋮ Proximity search for 0--1 mixed-integer convex programming ⋮ Rounding-based heuristics for nonconvex MINLPS ⋮ A primal heuristic for optimizing the topology of gas networks based on dual information ⋮ A proximal-point outer approximation algorithm ⋮ Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior ⋮ Feasibility pump for aircraft deconfliction with speed regulation ⋮ Integrality gap minimization heuristics for binary mixed integer nonlinear programming ⋮ Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming ⋮ Using regularization and second order information in outer approximation for convex MINLP ⋮ RENS. The optimal rounding ⋮ Static Analysis by Abstract Interpretation: A Mathematical Programming Approach ⋮ Improving the performance of DICOPT in convex MINLP problems using a feasibility pump ⋮ A constraints-aware reweighted feasibility pump approach ⋮ Mixed integer nonlinear programming tools: a practical overview ⋮ Ten years of feasibility pump, and counting ⋮ Alternative regularizations for outer-approximation algorithms for convex MINLP ⋮ Generalized relax-and-fix heuristic ⋮ A Mixed-Integer PDE-Constrained Optimization Formulation for Electromagnetic Cloaking ⋮ An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs ⋮ Nonlinear chance-constrained problems with applications to hydro scheduling ⋮ Towards an objective feasibility pump for convex minlps
Uses Software
Cites Work
- An algorithmic framework for convex mixed integer nonlinear programs
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- The feasibility pump
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
