Pivot and shift -- a mixed integer programming heuristic

DOI10.1016/J.DISOPT.2004.03.001MaRDI QIDQ2386208zbMATH OpenOpenAlexFDO

Authors E. Balas, S. H. Schmieta, 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

zbMATH Keywords

HeuristicsLocal branchingMixed integer programmingNeighborhood searchPivot and complement

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A dual heuristic for mixed integer programming
• A pivoting algorithm for linear programming with linear complementarity constraints
• Simplicial pivoting algorithms for a tractable class of integer programs
• Pivot rules for linear programming: A survey on recent theoretical developments
• The pivot and probe algorithm for solving a linear program
• Heuristics for convex mixed integer nonlinear programs
• Feasibility Pump-like heuristics for mixed integer problems
• Large-scale mixed integer programming: Benders-type heuristics
• A note on the pivot and complement heuristic for 0-1 programming problems
• Conflict-Driven Heuristics for Mixed Integer Programming

Cites work

• Local branching
• Pivot and Complement–A Heuristic for 0-1 Programming

Cited in

(31)

• Feasibility pump 2.0
• A note on the pivot and complement heuristic for 0-1 programming problems
• Adaptive kernel search: a heuristic for solving mixed integer linear programs
• Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
• Steiner tree packing revisited
• On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
• Generalized relax-and-fix heuristic
• A primal heuristic for optimizing the topology of gas networks based on dual information
• 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
• Feasibility Pump-like heuristics for mixed integer problems
• Repairing MIP infeasibility through local branching
• A feasibility pump heuristic for general mixed-integer problems
• Improving the feasibility pump
• Variable neighborhood search and local branching
• The feasibility pump
• Integrating pivot based search with branch and bound for binary MIPs
• Boosting the feasibility pump
• Proximity search for 0--1 mixed-integer convex programming
• Shift-and-propagate
• Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints
• Feasibility jump: an LP-free Lagrangian MIP heuristic
• An interior point cutting plane heuristic for mixed integer programming
• Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
• Augmentation search for integer programming over a polyhedron
• Last fifty years of integer linear programming: a focus on recent practical advances
• ZI round, a MIP rounding heuristic
• A computational study of parametric tabu search for 0-1 mixed integer programs
• RENS. The optimal rounding
• Active-constraint variable ordering for faster feasibility of mixed integer linear programs

This page was built for publication: Pivot and shift -- a mixed integer programming heuristic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2386208)