Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
From MaRDI portal
(Redirected from Publication:5962716)
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; zbMATH DE number 5863207
Cites work
- A Linear Programming Approach to the Cutting-Stock Problem
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- A strongly polynomial algorithm for line search in submodular polyhedra
- A survey of dual-feasible and superadditive functions
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- An improved typology of cutting and packing problems
- Branch-and-price: Column generation for solving huge integer programs
- Comparison of bundle and classical column generation
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Cutting Stock Problems
- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Hybrid column generation for large-size covering integer programs: application to transportation planning
- Implementing Mixed Integer Column Generation
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- New developments in the primal-dual column generation technique
- New stabilization procedures for the cutting stock problem
- Primal cutting plane algorithms revisited
- Primal integer programming
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Selected Topics in Column Generation
- Separation algorithms for 0-1 knapsack polytopes
- Submodular function minimization
- The shortest-path problem with resource constraints and k-cycle elimination for k 3
- Where are the hard knapsack problems?
Cited in
(5)- Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
- Projective cutting-planes
- 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)
