A feasibility pump for mixed integer nonlinear programs
From MaRDI portal
Publication:1013979
DOI10.1007/S10107-008-0212-2zbMATH Open1163.90013OpenAlexW2160783673MaRDI QIDQ1013979FDOQ1013979
Authors: Pierre Bonami, Andrea Lodi, Gérard Cornuéjols, François Margot 
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
Recommendations
Cites Work
- An algorithmic framework for convex mixed integer nonlinear programs
- 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
- Relaxation and decomposition methods for mixed integer nonlinear programming.
Cited In (57)
- Interactive dynamic optimization server -- connecting one modelling language with many solvers
- Matheuristics approaches for the satellite constellation design problem
- The Chebyshev center as an alternative to the analytic center in the feasibility pump
- Generating feasible points for mixed-integer convex optimization problems by inner parallel cuts
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- A mixed-integer PDE-constrained optimization formulation for electromagnetic cloaking
- Mixed integer nonlinear programming tools: a practical overview
- A computational study of primal heuristics inside an MI(NL)P solver
- Towards an objective feasibility pump for convex minlps
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
- A primal heuristic for optimizing the topology of gas networks based on dual information
- Heuristics for convex mixed integer nonlinear programs
- Generalized relax-and-fix heuristic
- Computing feasible points for binary MINLPs with MPECs
- Nonlinear chance-constrained problems with applications to hydro scheduling
- A partial outer convexification approach to control transmission lines
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
- Inversion of convection-diffusion equation with discrete sources
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
- Feasibility pump for aircraft deconfliction with speed regulation
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming
- Feasibility in reverse convex mixed-integer programming
- A proximal-point outer approximation algorithm
- Proximity search for 0--1 mixed-integer convex programming
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- Using regularization and second order information in outer approximation for convex MINLP
- A storm of feasibility pumps for nonconvex MINLP
- The supporting hyperplane optimization toolkit for convex MINLP
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Multistart algorithms for seeking feasibility
- A disjunctive cut strengthening technique for convex MINLP
- Ten years of feasibility pump, and counting
- Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior
- A recipe for finding good solutions to MINLPs
- Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps
- A feasibility pump heuristic for general mixed-integer problems
- Multidimensional sum-up rounding for integer programming in optimal experimental design
- Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems
- RENS. The optimal rounding
- Inexact feasibility pump for mixed integer nonlinear programming
- Static analysis by abstract interpretation: a mathematical programming approach
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Improving the randomization step in feasibility pump
- A constraints-aware reweighted feasibility pump approach
- Three ideas for a feasibility pump for nonconvex MINLP
- Irreducible infeasible sets in convex mixed-integer programs
- Combinatorial integral approximation
- Rounding-based heuristics for nonconvex MINLPS
- Feasibility pump algorithm for sparse representation under Laplacian noise
- Solving multiobjective mixed integer convex optimization problems
- Improving the performance of DICOPT in convex MINLP problems using a feasibility pump
- Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming
- Alternative regularizations for outer-approximation algorithms for convex MINLP
- Mixed integer nonlinear programming tools: an updated practical overview
- A New Approach to the Feasibility Pump in Mixed Integer Programming
- Inexact solution of NLP subproblems in MINLP
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
Uses Software
This page was built for publication: A feasibility pump for mixed integer nonlinear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013979)
