The following pages link to MIPLIB (Q16254):
Displaying 50 items.
- The double pivot simplex method (Q684156) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound (Q707082) (← links)
- ZI round, a MIP rounding heuristic (Q707735) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Testing cut generators for mixed-integer linear programming (Q734353) (← links)
- Restrict-and-relax search for 0-1 mixed-integer programs (Q743638) (← links)
- On the safety of Gomory cut generators (Q744203) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- Depth-optimized convexity cuts (Q817181) (← links)
- Integer-programming software systems (Q817202) (← links)
- Incorporating bounds from decision diagrams into integer programming (Q823882) (← links)
- Approximating the stability region for binary mixed-integer programs (Q833592) (← links)
- How to select a small set of diverse solutions to mixed integer programming problems (Q833594) (← links)
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts (Q834596) (← links)
- MIR closures of polyhedral sets (Q847821) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Coefficient strengthening: a tool for reformulating mixed-integer programs (Q847848) (← links)
- Mixed-integer cuts from cyclic groups (Q868450) (← links)
- Optimizing over the first Chvátal closure (Q877190) (← links)
- Cut generation through binarization (Q896284) (← links)
- Progress in presolving for mixed integer programming (Q903920) (← links)
- On the strength of Gomory mixed-integer cuts as group cuts (Q948966) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- Computing with multi-row gomory cuts (Q969515) (← links)
- Kernel search: a general heuristic for the multi-dimensional knapsack problem (Q976023) (← links)
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs (Q985305) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Cutting plane algorithms for the inverse mixed integer linear programming problem (Q1015310) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation (Q1029627) (← links)
- Improving Benders decomposition using a genetic algorithm (Q1042103) (← links)
- Feasibility pump 2.0 (Q1043854) (← links)
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) (← links)
- Cutting planes for integer programs with general integer variables (Q1290616) (← links)
- Solving \(0/1\) integer programs with enumeration cutting planes (Q1339119) (← links)
- Distributed versus centralized storage and control for parallel branch and bound: Mixed integer programming on the CM-5 (Q1360245) (← links)
- A distributed processing algorithm for solving integer programs using a cluster of workstations (Q1391780) (← links)
- The integral basis method for integer programming (Q1396977) (← links)
- The long step rule in the bounded-variable dual simplex method: Numerical experiments (Q1397068) (← links)
- A primal all-integer algorithm based on irreducible solutions (Q1424268) (← links)
- On the facets of the mixed-integer knapsack polyhedron (Q1424283) (← links)
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs (Q1586209) (← links)
- Advances in design and implementation of optimization software (Q1598765) (← links)
- Intersection cuts for single row corner relaxations (Q1621696) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
