Pages that link to "Item:Q3634996"
From MaRDI portal
The following pages link to Octane: A New Heuristic for Pure 0–1 Programs (Q3634996):
Displayed 28 items.
- Octane (Q31606) (← links)
- Shift-and-propagate (Q524884) (← links)
- Faster integer-feasibility in mixed-integer linear programs by branching to force change (Q632648) (← 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)
- A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- On a fix-and-relax framework for a class of project scheduling problems (Q817205) (← links)
- A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs (Q985305) (← links)
- Feasibility pump 2.0 (Q1043854) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← 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)
- Exploring relaxation induced neighborhoods to improve MIP solutions (Q1769074) (← 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)
- Multidimensional sum-up rounding for integer programming in optimal experimental design (Q2220654) (← links)
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs (Q2352416) (← 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)
- A variable neighborhood decomposition search method for supply chain management planning problems (Q2433455) (← 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)
- The feasibility pump (Q2571001) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)