Pages that link to "Item:Q5292084"

The following pages link to Computational Integer Programming and Cutting Planes (Q5292084):

Displaying 14 items.

• Three enhancements for optimization-based bound tightening (Q522269) (← links)
• The multiple traveling salesmen problem with moving targets (Q895767) (← links)
• Progress in presolving for mixed integer programming (Q903920) (← links)
• Solving a school bus scheduling problem with integer programming (Q954937) (← 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)
• Improving strong branching by domain propagation (Q2513744) (← links)
• Arc routing under uncertainty: introduction and literature review (Q2669541) (← links)
• Presolve Reductions in Mixed Integer Programming (Q3386778) (← links)
• Constraint Integer Programming: A New Approach to Integrate CP and MIP (Q5387617) (← links)