IDEAS home Printed from https://ideas.repec.org/r/inm/orijoc/v30y2018i2p339-360.html
   My bibliography  Save this item

Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Artur Alves Pessoa & Michael Poss & Ruslan Sadykov & François Vanderbeck, 2021. "Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty," Operations Research, INFORMS, vol. 69(3), pages 739-754, May.
  2. Demiröz, Barış Evrim & Altınel, İ. Kuban & Akarun, Lale, 2019. "Rectangle blanket problem: Binary integer linear programming formulation and solution algorithms," European Journal of Operational Research, Elsevier, vol. 277(1), pages 62-83.
  3. Flores-Quiroz, Angela & Strunz, Kai, 2021. "A distributed computing framework for multi-stage stochastic planning of renewable power systems with energy storage as flexibility option," Applied Energy, Elsevier, vol. 291(C).
  4. Gauthier, Jean Bertrand & Desrosiers, Jacques, 2022. "The minimum mean cycle-canceling algorithm for linear programs," European Journal of Operational Research, Elsevier, vol. 298(1), pages 36-44.
  5. Artur Alves Pessoa & Teobaldo Bulhões & Vitor Nesello & Anand Subramanian, 2022. "Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1512-1530, May.
  6. Ayşe N. Arslan & Boris Detienne, 2022. "Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 857-871, March.
  7. Griset, Rodolphe & Bendotti, Pascale & Detienne, Boris & Porcheron, Marc & Şen, Halil & Vanderbeck, François, 2022. "Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem," European Journal of Operational Research, Elsevier, vol. 298(3), pages 1067-1083.
  8. Xiaoyun Xiong & Peng Zhou & Yunqiang Yin & T. C. E. Cheng & Dengfeng Li, 2019. "An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(6), pages 502-516, September.
  9. François Clautiaux & Boris Detienne & Henri Lefebvre, 2023. "A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty," Journal of Scheduling, Springer, vol. 26(2), pages 169-191, April.
  10. Xu, Yifan & Adler, Nicole & Wandelt, Sebastian & Sun, Xiaoqian, 2024. "Competitive integrated airline schedule design and fleet assignment," European Journal of Operational Research, Elsevier, vol. 314(1), pages 32-50.
  11. Renaud Chicoisne, 2023. "Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes," Computational Optimization and Applications, Springer, vol. 84(3), pages 789-831, April.
  12. Froger, Aurélien & Sadykov, Ruslan, 2023. "New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources," European Journal of Operational Research, Elsevier, vol. 306(1), pages 65-82.
  13. François Clautiaux & Ruslan Sadykov & François Vanderbeck & Quentin Viaud, 2019. "Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(3), pages 265-297, September.
  14. Ruslan Sadykov & Eduardo Uchoa & Artur Pessoa, 2021. "A Bucket Graph–Based Labeling Algorithm with Application to Vehicle Routing," Transportation Science, INFORMS, vol. 55(1), pages 4-28, 1-2.
  15. Brotcorne, L. & Escalona, P. & Fortz, B. & Labbé, M., 2021. "Fare inspection patrols scheduling in transit systems using a Stackelberg game approach," Transportation Research Part B: Methodological, Elsevier, vol. 154(C), pages 1-20.
  16. Göke, Leonard & Schmidt, Felix & Kendziorski, Mario, 2024. "Stabilized Benders decomposition for energy planning under climate uncertainty," European Journal of Operational Research, Elsevier, vol. 316(1), pages 183-199.
  17. Artur Pessoa & Ruslan Sadykov & Eduardo Uchoa, 2021. "Solving Bin Packing Problems Using VRPSolver Models," SN Operations Research Forum, Springer, vol. 2(2), pages 1-25, June.
  18. Orlando Rivera Letelier & François Clautiaux & Ruslan Sadykov, 2022. "Bin Packing Problem with Time Lags," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2249-2270, July.
  19. Queiroga, Eduardo & Frota, Yuri & Sadykov, Ruslan & Subramanian, Anand & Uchoa, Eduardo & Vidal, Thibaut, 2020. "On the exact solution of vehicle routing problems with backhauls," European Journal of Operational Research, Elsevier, vol. 287(1), pages 76-89.
  20. Wu, Lingxiao & Wang, Shuaian & Laporte, Gilbert, 2021. "The Robust Bulk Ship Routing Problem with Batched Cargo Selection," Transportation Research Part B: Methodological, Elsevier, vol. 143(C), pages 124-159.
  21. Luciano Costa & Claudio Contardo & Guy Desaulniers & Julian Yarkony, 2022. "Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1141-1156, March.
  22. Sebastian Kraul & Markus Seizinger & Jens O. Brunner, 2023. "Machine Learning–Supported Prediction of Dual Variables for the Cutting Stock Problem with an Application in Stabilized Column Generation," INFORMS Journal on Computing, INFORMS, vol. 35(3), pages 692-709, May.
  23. Bulhões, Teobaldo & Correia, Rubens & Subramanian, Anand, 2022. "Conference scheduling: A clustering-based approach," European Journal of Operational Research, Elsevier, vol. 297(1), pages 15-26.
  24. Stefan Faldum & Timo Gschwind & Stefan Irnich, 2023. "Subset-Row Inequalities and Unreachability in Path-based Formulations for Routing and Scheduling Problems," Working Papers 2310, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  25. Yang, Lingyi & Ng, Tsan Sheng & Lee, Loo Hay, 2022. "A robust approximation for yard template optimization under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 160(C), pages 21-53.
  26. Saharnaz Mehrani & Carlos Cardonha & David Bergman, 2022. "Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1070-1085, March.
  27. Morais, Rafael & Bulhões, Teobaldo & Subramanian, Anand, 2024. "Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates," European Journal of Operational Research, Elsevier, vol. 315(2), pages 442-453.
  28. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
  29. Teobaldo Bulhões & Ruslan Sadykov & Anand Subramanian & Eduardo Uchoa, 2020. "On the exact solution of a large class of parallel machine scheduling problems," Journal of Scheduling, Springer, vol. 23(4), pages 411-429, August.
  30. Ruslan Sadykov & François Vanderbeck & Artur Pessoa & Issam Tahiri & Eduardo Uchoa, 2019. "Primal Heuristics for Branch and Price: The Assets of Diving Methods," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 251-267, April.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.