Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems

References

• Benchimol P, Desaulniers G, Desrosiers J (2012) Stabilized dynamic constraint aggregation for solving set partitioning problems. Eur. J. Oper. Res. 223(2):360–371.Crossref, Google Scholar
• Briant O, Lemarchal C, Meurdesoif P, Michel S, Perrot N, Vanderbeck F (2008) Comparison of bundle and classical column generation. Math. Programming 113(2):299–344.Crossref, Google Scholar
• Clautiaux F, Alves C, de Carvalho J (2009) A survey of dual-feasible and superadditive functions. Ann. Oper. Res. 179(1):317–342.Crossref, Google Scholar
• Clautiaux F, Alves C, de Carvalho JV, Rietz J (2011) New stabilization procedures for the cutting stock problem. INFORMS J. Comput. 23(4):530–545.Link, Google Scholar
• de Carvalho JMV (2005) Using extra dual cuts to accelerate column generation. INFORMS J. Comput. 17(2):175–182.Link, Google Scholar
• Du Merle O, Villeneuve D, Desrosiers J, Hansen P (1999) Stabilized column generation. Discrete Math. 194:229–237.Crossref, Google Scholar
• Elhallaoui I, Metrane A, Soumis F, Desaulniers G (2010) Multi-phase dynamic constraint aggregation for set partitioning type problems. Math. Programming 123(2):345–370.Crossref, Google Scholar
• Elhallaoui I, Villeneuve D, Soumis F, Desaulniers G (2005) Dynamic aggregation of set-partitioning constraints in column generation. Oper. Res. 53(4):632–645.Link, Google Scholar
• Gschwind T, Irnich S (2016) Dual inequalities for stabilized column generation revisited. INFORMS J. Comput. 28(1):175–194.Link, Google Scholar
• Liang D, Wilhelm WE (2010) A generalization of column generation to accelerate convergence. Math. Programming A 122:349–378.Crossref, Google Scholar
• Lübbecke M, Desrosiers J (2005) Selected topics in column generation. Oper. Res. 53:1007–1023.Link, Google Scholar
• Macedo R, Alves C, de Carvalho JV, Clautiaux F, Hanafi S (2011) Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. Eur. J. Oper. Res. 214(3):536–545.Crossref, Google Scholar
• Marsten R, Hogan W, Blankenship J (1975) The BOXSTEP method for large-scale optimization. Oper. Res. 23(3):389–405.Link, Google Scholar
• Pessoa A, Sadykov R, Uchoa E, Vanderbeck F (2013) In-out separation and column generation stabilization by dual price smoothing. Bonifaci V, Demetrescu C, Marchetti-Spaccamela A, eds. 12th Internat. Sympos. Experiment. Algorithms (Springer, Berlin), 354–365.Crossref, Google Scholar
• Porumbel D (2016) Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation. Math. Programming 155(1):147–197.Crossref, Google Scholar
• Scholl A, Klein R, Jurgens C (1997) BISON: A fast hybrid procedure for exactly solving the one-dimensional bin-packing problem. Comput. Oper. Res. 24:627–645.Crossref, Google Scholar
• Vanderbeck F (1999) Computational study of a column generation algorithm for bin packing and cutting stock problems. Math. Programming 86(3):565–594.Crossref, Google Scholar
• Van Vyve M, Wolsey LA (2006) Approximate extended formulations. Math. Programming 105(2–3):501–522.Crossref, Google Scholar
• Wäscher G, Gau T (1996) Heuristics for the integer one-dimensional cutting stock problem: A computational study. OR Spektrum 18(3):131–144.Crossref, Google Scholar