Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
From MaRDI portal
Publication:5962716
DOI10.1007/s10107-014-0840-7zbMath1347.90059MaRDI QIDQ5962716
Publication date: 23 February 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-014-0840-7
dynamic programming; column generation; primal method; dual polytope; linear programs; ray projections
90C06: Large-scale problems in mathematical programming
90C11: Mixed integer programming
90C05: Linear programming
90C27: Combinatorial optimization
90C39: Dynamic programming
Related Items
Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems, Projective Cutting-Planes, From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints, Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
Cites Work
- Hybrid column generation for large-size covering integer programs: application to transportation planning
- A survey of dual-feasible and superadditive functions
- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- Primal cutting plane algorithms revisited
- Where are the hard knapsack problems?
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- New developments in the primal-dual column generation technique
- A strongly polynomial algorithm for line search in submodular polyhedra
- Comparison of bundle and classical column generation
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Separation algorithms for 0-1 knapsack polytopes
- An improved typology of cutting and packing problems
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- New Stabilization Procedures for the Cutting Stock Problem
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Selected Topics in Column Generation
- Cutting Stock Problems
- Implementing Mixed Integer Column Generation
- Unnamed Item
- Unnamed Item
