Heuristics for convex mixed integer nonlinear programs
From MaRDI portal
Recommendations
Cites work
- A feasibility pump for mixed integer nonlinear programs
- An algorithmic framework for convex mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Feasibility pump 2.0
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Local branching
- Solving mixed integer nonlinear programs by outer approximation
- The feasibility pump
Cited in
(35)- A new heuristic approach for non-convex optimization problems
- Finding feasible solutions to hard mixed-integer programming problems using hybrid heuristics
- Inexact feasibility pump for mixed integer nonlinear programming
- Rounding-based heuristics for nonconvex MINLPS
- Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps
- A recipe for finding good solutions to MINLPs
- Three ideas for a feasibility pump for nonconvex MINLP
- Pivot and shift -- a mixed integer programming heuristic
- A disjunctive cut strengthening technique for convex MINLP
- Matheuristics approaches for the satellite constellation design problem
- A computational study of primal heuristics inside an MI(NL)P solver
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- A primal heuristic for optimizing the topology of gas networks based on dual information
- A simple effective heuristic for embedded mixed-integer quadratic programming
- Large-Scale Loan Portfolio Selection
- Feasibility pump for aircraft deconfliction with speed regulation
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming
- Granularity in nonlinear mixed-integer optimization
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- A feasible rounding approach for mixed-integer optimization problems
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization
- Inexact solution of NLP subproblems in MINLP
- RENS. The optimal rounding
- Convex relaxations for mixed-integer nonlinear programs
- Computing feasible points for binary MINLPs with MPECs
- Towards an objective feasibility pump for convex minlps
- Generating feasible points for mixed-integer convex optimization problems by inner parallel cuts
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- Ten years of feasibility pump, and counting
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
This page was built for publication: Heuristics for convex mixed integer nonlinear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429468)
