Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems
From MaRDI portal
Publication:5058013
DOI10.1287/ijoc.2022.1160OpenAlexW4281296416MaRDI QIDQ5058013
Publication date: 1 December 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2022.1160
Related Items (1)
Uses Software
Cites Work
- Large-scale optimization with the primal-dual column generation method
- A survey of dual-feasible and superadditive functions
- From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- Projective Cutting-Planes
- Selected Topics in Column Generation
- Cutting Stock Problems
- Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
- Unnamed Item
This page was built for publication: Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems
