Pages that link to "Item:Q5292084"
From MaRDI portal
The following pages link to Computational Integer Programming and Cutting Planes (Q5292084):
Displaying 30 items.
- A computational study of conflict graphs and aggressive cut separation in integer programming (Q324843) (← links)
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- Logical processing for integer programming (Q817209) (← links)
- The multiple traveling salesmen problem with moving targets (Q895767) (← links)
- Progress in presolving for mixed integer programming (Q903920) (← links)
- Generating cuts in integer programming with families of special ordered sets (Q922293) (← links)
- Solving a school bus scheduling problem with integer programming (Q954937) (← links)
- Cutting plane algorithms for the inverse mixed integer linear programming problem (Q1015310) (← links)
- A surrogate cutting plane algorithm for all-integer programming (Q1086159) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- A solution framework for linear PDE-constrained mixed-integer problems (Q2044978) (← links)
- Branch-and-refine for solving time-expanded MILP formulations (Q2108138) (← links)
- A primal heuristic for optimizing the topology of gas networks based on dual information (Q2260914) (← links)
- Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
- Structure-driven fix-and-propagate heuristics for mixed integer programming (Q2295978) (← links)
- An iterative graph expansion approach for the scheduling and routing of airplanes (Q2337398) (← links)
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs (Q2442074) (← links)
- Improving strong branching by domain propagation (Q2513744) (← links)
- Arc routing under uncertainty: introduction and literature review (Q2669541) (← links)
- MIP: Theory and practice -- closing the gap (Q2712822) (← links)
- (Q3035141) (← links)
- Presolve Reductions in Mixed Integer Programming (Q3386778) (← links)
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming (Q3392018) (← links)
- Fenchel Cutting Planes for Integer Programs (Q4287599) (← links)
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition (Q4427317) (← links)
- (Q4518860) (← links)
- Constraint Integer Programming: A New Approach to Integrate CP and MIP (Q5387617) (← links)
