Pages that link to "Item:Q2386208"
From MaRDI portal
The following pages link to Pivot and shift -- a mixed integer programming heuristic (Q2386208):
Displaying 29 items.
- Boosting the feasibility pump (Q495939) (← links)
- Proximity search for 0--1 mixed-integer convex programming (Q524882) (← links)
- Shift-and-propagate (Q524884) (← links)
- An interior point cutting plane heuristic for mixed integer programming (Q632679) (← links)
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs (Q683326) (← links)
- ZI round, a MIP rounding heuristic (Q707735) (← links)
- A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs (Q985305) (← links)
- Feasibility pump 2.0 (Q1043854) (← links)
- A note on the pivot and complement heuristic for 0-1 programming problems (Q1113801) (← links)
- Adaptive kernel search: a heuristic for solving mixed integer linear programs (Q1694819) (← links)
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump (Q1728378) (← links)
- Steiner tree packing revisited (Q1935940) (← links)
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs (Q2064299) (← links)
- Generalized relax-and-fix heuristic (Q2108128) (← links)
- A primal heuristic for optimizing the topology of gas networks based on dual information (Q2260914) (← links)
- A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs (Q2371471) (← links)
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs (Q2393650) (← links)
- Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
- Feasibility Pump-like heuristics for mixed integer problems (Q2448898) (← links)
- Repairing MIP infeasibility through local branching (Q2459381) (← links)
- A feasibility pump heuristic for general mixed-integer problems (Q2471275) (← links)
- Improving the feasibility pump (Q2471276) (← links)
- Variable neighborhood search and local branching (Q2489139) (← links)
- The feasibility pump (Q2571001) (← links)
- Integrating pivot based search with branch and bound for binary MIPs (Q2731680) (← links)
- Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints (Q6088241) (← links)
- Feasibility jump: an LP-free Lagrangian MIP heuristic (Q6175707) (← links)