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

References

• Ben-Ameur W, Neto J (2007) Acceleration of cutting-plane and column generation algorithms: Applications to network design. Networks 49(1):3–17.Crossref, Google Scholar
• Ben Amor H, de Carvalho JMV (2005) Cutting stock problems. Desaulniers G, Desrosiers J, Solomon MM, eds. Column Generation, vol. 5 (Springer, Berlin), 131–161.Crossref, Google Scholar
• Clautiaux F, Alves C, de Carvalho JMV (2009) A survey of dual-feasible and superadditive functions. Ann. Oper. Res. 179:317–342.Crossref, Google Scholar
• Fischetti M, Monaci M (2012) Cutting plane vs. compact formulations for uncertain (integer) linear programs. Math. Programming Comput. 4:239–273.Crossref, Google Scholar
• Gondzio J, González-Brevis P, Munari P (2016) Large-scale optimization with the primal-dual column generation method. Math. Programming Comput. 8(1):47–82.Crossref, Google Scholar
• Held S, Cook W, Sewell EC (2012) Maximum-weight stable sets and safe lower bounds for graph coloring. Math. Programming Comput. 4:363–381.Crossref, Google Scholar
• Knuth D (1998) The Art of Computer Programming, Volume 3: Sorting and Searching (Addison-Wesley, Boston).Google Scholar
• Lübbecke ME, Desrosiers J (2005) Selected topics in column generation. Oper. Res. 53(6):1007–1023.Link, Google Scholar
• Pessoa A, Sadykov R, Uchoa E, Vanderbeck F (2013) In-out separation and column generation stabilization by dual price smoothing. 12th Internat. Sympos. Experiment. Algorithms (Springer, Berlin), 354–365.Google Scholar
• Porumbel D (2016) Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation. Math. Programming 155(1–2):147–197.Crossref, Google Scholar
• Porumbel D (2018) From the separation to the intersection subproblem for optimizing polytopes with prohibitively many constraints in a Benders decomposition context. Discrete Optim. 29:148–173.Crossref, Google Scholar
• Porumbel D (2020) Projective cutting-planes. SIAM J. Optim. 30:1007–1032.Crossref, Google Scholar
• Porumbel D (2021) Projective cutting-planes for robust linear programming and cutting-stock problems. Accessed September 5, 2022, http://dx.doi.org/10.5281/zenodo.5745335, https://github.com/INFORMSJoC/2020.0068.Google Scholar
• Porumbel D, Clautiaux F (2017) Constraint aggregation in column generation models for resource-constrained covering problems. INFORMS J. Comput. 29(1):170–184.Link, Google Scholar
• Vanderbeck F (1999) Computational study of a column generation algorithm for bin packing and cutting stock problems. Math. Programming 86:565–594.Crossref, Google Scholar