Decomposition and dynamic cut generation in integer linear programming
DOI10.1007/S10107-005-0606-3zbMATH Open1134.90448OpenAlexW1988044254MaRDI QIDQ2490337FDOQ2490337
Matthew V. Galati, Ted K. Ralphs
Publication date: 2 May 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0606-3
Recommendations
Branch and PriceInteger ProgrammingBranch and CutDantzig-Wolfe DecompositionDecomposition AlgorithmsLagrangian Relaxation
Mixed integer programming (90C11) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- Title not available (Why is that?)
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Facets of the three-index assignment polytope
- Title not available (Why is that?)
- Title not available (Why is that?)
- Selected Topics in Column Generation
- The ellipsoid method and its consequences in combinatorial optimization
- Tree polytope on 2-trees
- Lagrangean heuristics for location problems
- The truck dispatching problem
- Branch-and-price: Column generation for solving huge integer programs
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- On constrained optimization by adjoint based quasi-Newton methods
- Algorithms for the set covering problem
- The Steiner tree polytope and related polyhedra
- Decomposition Principle for Linear Programs
- Title not available (Why is that?)
- The volume algorithm: Producing primal solutions with a subgradient method
- Lagrangean relaxation. (With comments and rejoinder).
- On the capacitated vehicle routing problem
- 2-path cuts for the vehicle routing problem with time windows
- Lot-sizing with start-up times
- An SST-based algorithm for the steiner problem in graphs
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Plant location with minimum inventory
- Optimal Routing under Capacity and Distance Restrictions
- Combining Column Generation and Lagrangian Relaxation
- An Algorithm for the Three-Index Assignment Problem
- Title not available (Why is that?)
- A Lagrangian relaxation approach to the edge-weighted clique problem
- Efficient cuts in Lagrangean `relax-and-cut' schemes
- A restricted Lagrangean approach to the traveling salesman problem
- Title not available (Why is that?)
- Optimal rectangular partitions
- Stronger \(K\)-tree relaxations for the vehicle routing problem
- Linear-time separation algorithms for the three-index assignment polytope
- A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems
- Polyhedral techniques in combinatorial optimization I: Theory
- Title not available (Why is that?)
Cited In (8)
- Testing cut generators for mixed-integer linear programming
- Title not available (Why is that?)
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
- A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles
- Decomposition, reformulation, and diving in university course timetabling
- Non delayed relax-and-cut algorithms
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- Decomposition-based inner- and outer-refinement algorithms for global optimization
Uses Software
This page was built for publication: Decomposition and dynamic cut generation in integer linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490337)
