Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
DOI10.1007/S10107-014-0840-7zbMATH Open1347.90059OpenAlexW2079451635MaRDI QIDQ5962716FDOQ5962716
Authors: Daniel Cosmin Porumbel 
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
Recommendations
- Generalized column generation for linear programming
- Linear fractional approximations for master problems in column generation
- A constraint generation algorithm for large scale linear programs using multiple-points separation
- Cutting planes and column generation techniques with the projective algorithm
- scientific article
Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27) Dynamic programming (90C39) Mixed integer programming (90C11)
Cites Work
- A Linear Programming Approach to the Cutting-Stock Problem
- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- An improved typology of cutting and packing problems
- The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
- Selected Topics in Column Generation
- Where are the hard knapsack problems?
- New developments in the primal-dual column generation technique
- Comparison of bundle and classical column generation
- Separation algorithms for 0-1 knapsack polytopes
- Branch-and-price: Column generation for solving huge integer programs
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Implementing Mixed Integer Column Generation
- 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
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- Cutting Stock Problems
- A survey of dual-feasible and superadditive functions
- New stabilization procedures for the cutting stock problem
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- Hybrid column generation for large-size covering integer programs: application to transportation planning
- Submodular function minimization
- Primal cutting plane algorithms revisited
- Primal integer programming
- A strongly polynomial algorithm for line search in submodular polyhedra
Cited In (5)
- Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems
- Projective Cutting-Planes
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
- From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints
- A constraint generation algorithm for large scale linear programs using multiple-points separation
This page was built for publication: Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962716)
