Shift-and-propagate
From MaRDI portal
Publication:524884
DOI10.1007/s10732-014-9271-0zbMath1360.90297OpenAlexW2056121010MaRDI QIDQ524884
Publication date: 26 April 2017
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-014-9271-0
Integer programming (90C10) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A hybrid primal heuristic for finding feasible solutions to mixed integer programs, Feasibility jump: an LP-free Lagrangian MIP heuristic, Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs, Experiments with conflict analysis in mixed integer programming, Computational aspects of infeasibility analysis in mixed integer programming
Uses Software
Cites Work
- Unnamed Item
- ZI round, a MIP rounding heuristic
- Feasibility pump 2.0
- Integer optimization by local search. A domain-independent approach
- General purpose heuristics for integer programming. I
- General purpose heuristics for integer programming. II
- Local search with constraint propagation and conflict-based heuristics
- Solving zero-one mixed integer programming problems using tabu search
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Presolving in linear programming
- Pivot and shift -- a mixed integer programming heuristic
- Measuring the impact of primal heuristics
- MIPLIB 2003
- Conflict analysis in mixed integer programming
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- Variable neighborhood search and local branching
- The feasibility pump
- Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
- Rapid Learning for Binary Programs
- Octane: A New Heuristic for Pure 0–1 Programs
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Rounding and Propagation Heuristics for Mixed Integer Programming
- Heuristics of the Branch-Cut-and-Price-Framework SCIP
- DINS, a MIP Improvement Heuristic
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem