Pivot and shift -- a mixed integer programming heuristic
From MaRDI portal
Publication:2386208
DOI10.1016/j.disopt.2004.03.001zbMath1087.90052OpenAlexW2003617534MaRDI QIDQ2386208
Stefan Schmieta, Egon Balas, Christopher Wallace
Publication date: 22 August 2005
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2004.03.001
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs, An empirical evaluation of walk-and-round heuristics for mixed integer linear programs, Mathematical programming based heuristics for the 0--1 MIP: a survey, Steiner tree packing revisited, Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints, Adaptive kernel search: a heuristic for solving mixed integer linear programs, Feasibility jump: an LP-free Lagrangian MIP heuristic, An interior point cutting plane heuristic for mixed integer programming, Feasibility Pump-like heuristics for mixed integer problems, Generation of feasible integer solutions on a massively parallel computer using the feasibility pump, Repairing MIP infeasibility through local branching, Boosting the feasibility pump, A feasibility pump heuristic for general mixed-integer problems, Improving the feasibility pump, Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs, Shift-and-propagate, A primal heuristic for optimizing the topology of gas networks based on dual information, Variable neighborhood search and local branching, A computational study of parametric tabu search for 0-1 mixed integer programs, Active-constraint variable ordering for faster feasibility of mixed integer linear programs, RENS. The optimal rounding, On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs, Feasibility pump 2.0, The feasibility pump, Generalized relax-and-fix heuristic
Cites Work
