The following pages link to The feasibility pump (Q2571001):
Displaying 50 items.
- Towards an objective feasibility pump for convex minlps (Q263161) (← links)
- Improving branch-and-cut performance by random sampling (Q266414) (← links)
- Achieving MILP feasibility quickly using general disjunctions (Q336442) (← links)
- Recursive central rounding for mixed integer programs (Q336910) (← links)
- Fix-and-relax approaches for controlled tabular adjustment (Q337507) (← links)
- An exact algorithm for biobjective mixed integer linear programming problems (Q342401) (← links)
- Inexact feasibility pump for mixed integer nonlinear programming (Q344569) (← links)
- Modeling and solving the mixed capacitated general routing problem (Q375984) (← links)
- A recipe for finding good solutions to MINLPs (Q384810) (← links)
- Using the analytic center in the feasibility pump (Q408384) (← links)
- Heuristics for convex mixed integer nonlinear programs (Q429468) (← links)
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times (Q439552) (← links)
- Boosting the feasibility pump (Q495939) (← links)
- Proximity search for 0--1 mixed-integer convex programming (Q524882) (← 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 primal heuristics inside an MI(NL)P solver (Q683729) (← links)
- Polylithic modeling and solution approaches using algebraic modeling systems (Q691438) (← links)
- ZI round, a MIP rounding heuristic (Q707735) (← links)
- A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
- Feasibility pump for aircraft deconfliction with speed regulation (Q721163) (← links)
- Restrict-and-relax search for 0-1 mixed-integer programs (Q743638) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- Integer-programming software systems (Q817202) (← links)
- On the strength of Gomory mixed-integer cuts as group cuts (Q948966) (← 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)
- A feasibility pump for mixed integer nonlinear programs (Q1013979) (← links)
- Cut generation for an integrated employee timetabling and production scheduling problem (Q1037686) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- Improving Benders decomposition using a genetic algorithm (Q1042103) (← links)
- Feasibility pump 2.0 (Q1043854) (← links)
- The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach (Q1651527) (← links)
- The green capacitated multi-item lot sizing problem with parallel machines (Q1651651) (← links)
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration (Q1652297) (← links)
- A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines (Q1652346) (← links)
- Adaptive kernel search: a heuristic for solving mixed integer linear programs (Q1694819) (← links)
- A hybrid primal heuristic for finding feasible solutions to mixed integer programs (Q1695014) (← links)
- Variable neighborhood search: basics and variants (Q1707084) (← links)
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump (Q1728378) (← links)
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials (Q1737490) (← links)
- Generalized local branching heuristics and the capacitated ring tree problem (Q1744240) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- A multi-item approach to repairable stocking and expediting in a fluctuating demand environment (Q1752175) (← links)
- The search-and-remove algorithm for biobjective mixed-integer linear programming problems (Q1754323) (← links)
- MIP formulations and heuristics for two-level production-transportation problems (Q1761227) (← links)
- Rounding-based heuristics for nonconvex MINLPS (Q1762458) (← links)
- Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior (Q1782155) (← links)
