Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems
From MaRDI portal
Publication:5058013
Recommendations
Cites work
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- A survey of dual-feasible and superadditive functions
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems
- Cutting Stock Problems
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints
- Large-scale optimization with the primal-dual column generation method
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Projective cutting-planes
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
- Selected Topics in Column Generation
Cited in
(2)
This page was built for publication: Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058013)