Pages that link to "Item:Q429468"
From MaRDI portal
The following pages link to Heuristics for convex mixed integer nonlinear programs (Q429468):
Displaying 34 items.
- Towards an objective feasibility pump for convex minlps (Q263161) (← links)
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems (Q319659) (← links)
- Inexact feasibility pump for mixed integer nonlinear programming (Q344569) (← links)
- A recipe for finding good solutions to MINLPs (Q384810) (← links)
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming (Q486413) (← links)
- A computational study of primal heuristics inside an MI(NL)P solver (Q683729) (← links)
- Feasibility pump for aircraft deconfliction with speed regulation (Q721163) (← links)
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming (Q721171) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- A new heuristic approach for non-convex optimization problems (Q985056) (← links)
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- Computing feasible points for binary MINLPs with MPECs (Q1741127) (← links)
- Rounding-based heuristics for nonconvex MINLPS (Q1762458) (← links)
- Inexact solution of NLP subproblems in MINLP (Q1942026) (← links)
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
- A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
- An overview of MINLP algorithms and their implementation in Muriqui optimizer (Q2178345) (← links)
- A primal heuristic for optimizing the topology of gas networks based on dual information (Q2260914) (← links)
- Granularity in nonlinear mixed-integer optimization (Q2302751) (← links)
- Ten years of feasibility pump, and counting (Q2329705) (← links)
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs (Q2352416) (← links)
- Three ideas for a feasibility pump for nonconvex MINLP (Q2361121) (← links)
- Pivot and shift -- a mixed integer programming heuristic (Q2386208) (← links)
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs (Q2393650) (← links)
- A feasible rounding approach for mixed-integer optimization problems (Q2419508) (← links)
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383) (← links)
- Large-Scale Loan Portfolio Selection (Q2957455) (← links)
- Convex relaxations for mixed-integer nonlinear programs (Q4605948) (← links)
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (Q4637830) (← links)
- Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts (Q5158763) (← links)
- A simple effective heuristic for embedded mixed-integer quadratic programming (Q5207801) (← links)
- Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps (Q5348468) (← links)
- Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization (Q6114963) (← links)
- Matheuristics approaches for the satellite constellation design problem (Q6572734) (← links)
