Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems

DOI10.1287/IJOC.2022.1160OpenAlexW4281296416MaRDI QIDQ5058013FDOQ5058013

Daniel Cosmin Porumbel

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

zbMATH Keywords

algorithmsintegerlinearcutting plane631 programming642 programming643 programming

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Title not available (Why is that?)
• Selected Topics in Column Generation
• Large-scale optimization with the primal-dual column generation method
• 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 Stock Problems
• A survey of dual-feasible and superadditive functions
• Acceleration of cutting-plane and column generation algorithms: Applications to network design
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• Projective Cutting-Planes
• From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints
• Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
• Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems

Cited In (2)

• Projective Cutting-Planes
• Cutting planes and column generation techniques with the projective algorithm

Uses Software

• GitHub

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)