Computational Integer Programming and Cutting Planes
From MaRDI portal
Publication:5292084
DOI10.1016/S0927-0507(05)12002-7zbMath1278.90269MaRDI QIDQ5292084
Alexander Martin, Armin Fügenschuh
Publication date: 19 June 2007
Published in: Discrete Optimization (Search for Journal in Brave)
Related Items
Arc routing under uncertainty: introduction and literature review, The multiple traveling salesmen problem with moving targets, Progress in presolving for mixed integer programming, Constraint Integer Programming: A New Approach to Integrate CP and MIP, Solving a school bus scheduling problem with integer programming, Three enhancements for optimization-based bound tightening, A primal heuristic for optimizing the topology of gas networks based on dual information, Solving linear programs with complementarity constraints using branch-and-cut, Improving strong branching by domain propagation, A solution framework for linear PDE-constrained mixed-integer problems, Structure-driven fix-and-propagate heuristics for mixed integer programming, Presolve Reductions in Mixed Integer Programming, An iterative graph expansion approach for the scheduling and routing of airplanes, Branch-and-refine for solving time-expanded MILP formulations
Uses Software
