Cited in
(35)- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
- Repairing MIP infeasibility through local branching
- Generalized relax-and-fix heuristic
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- A computational study of parametric tabu search for 0-1 mixed integer programs
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
- Feasibility pump 2.0
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
- On a fix-and-relax framework for a class of project scheduling problems
- RAMP
- MIPLIB
- FEASPUMP
- MIPLIB2003
- DINS
- bc-prod
- MULTILSB
- iOptimize
- POPMUSIC
- An interior point cutting plane heuristic for mixed integer programming
- Exploring relaxation induced neighborhoods to improve MIP solutions
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- Multidimensional sum-up rounding for integer programming in optimal experimental design
- The feasibility pump
- RENS. The optimal rounding
- Faster integer-feasibility in mixed-integer linear programs by branching to force change
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- Restrict-And-Fix
- The multidimensional 0-1 knapsack problem: an overview.
- A heuristic approach for big bucket multi-level production planning problems
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
- Shift-and-propagate
This page was built for software: Octane
