Lera-Romero, Gonzalo; Miranda Bront, Juan J.; Soulignac, Francisco J. Linear edge costs and labeling algorithms: the case of the time-dependent vehicle routing problem with time windows. (English) Zbl 07769705 Networks 76, No. 1, 24-53 (2020). MSC: 90Cxx PDFBibTeX XMLCite \textit{G. Lera-Romero} et al., Networks 76, No. 1, 24--53 (2020; Zbl 07769705) Full Text: DOI
Gabrel, Virginie; Mahjoub, A. Ridha; Taktak, Raouia; Uchoa, Eduardo The multiple Steiner TSP with order constraints: complexity and optimization algorithms. (English) Zbl 1491.90172 Soft Comput. 24, No. 23, 17957-17968 (2020). MSC: 90C35 90C05 90C10 PDFBibTeX XMLCite \textit{V. Gabrel} et al., Soft Comput. 24, No. 23, 17957--17968 (2020; Zbl 1491.90172) Full Text: DOI Link
Bender, Matthias; Kalcsics, Jörg Multi-period service territory design. (English) Zbl 1472.90051 Ríos-Mercado, Roger Z. (ed.), Optimal districting and territory design. Cham: Springer. Int. Ser. Oper. Res. Manag. Sci. 284, 129-152 (2020). MSC: 90B80 90C57 90C59 PDFBibTeX XMLCite \textit{M. Bender} and \textit{J. Kalcsics}, Int. Ser. Oper. Res. Manag. Sci. 284, 129--152 (2020; Zbl 1472.90051) Full Text: DOI
Kramer, Arthur; Dell’Amico, Mauro; Feillet, Dominique; Iori, Manuel Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time. (English) Zbl 1458.90314 Comput. Oper. Res. 123, Article ID 105018, 16 p. (2020). MSC: 90B35 90C11 90C57 PDFBibTeX XMLCite \textit{A. Kramer} et al., Comput. Oper. Res. 123, Article ID 105018, 16 p. (2020; Zbl 1458.90314) Full Text: DOI arXiv
Thun, Kristian; Andersson, Henrik; Stålhane, Magnus A branch-and-price algorithm for the liner shipping network design problem. (English) Zbl 1457.90020 SN Oper. Res. Forum 1, No. 4, Paper No. 28, 22 p. (2020). MSC: 90B06 90C05 90C11 90C57 90B10 PDFBibTeX XMLCite \textit{K. Thun} et al., SN Oper. Res. Forum 1, No. 4, Paper No. 28, 22 p. (2020; Zbl 1457.90020) Full Text: DOI
Byeon, Geunyeong; Van Hentenryck, Pascal; Bent, Russell; Nagarajan, Harsha Communication-constrained expansion planning for resilient distribution systems. (English) Zbl 1456.90038 INFORMS J. Comput. 32, No. 4, 968-985 (2020). MSC: 90B18 90C57 PDFBibTeX XMLCite \textit{G. Byeon} et al., INFORMS J. Comput. 32, No. 4, 968--985 (2020; Zbl 1456.90038) Full Text: DOI arXiv
Legrain, Antoine; Omer, Jérémy; Rosat, Samuel A rotation-based branch-and-price approach for the nurse scheduling problem. (English) Zbl 1452.90223 Math. Program. Comput. 12, No. 3, 417-450 (2020). MSC: 90C10 49M27 90C90 90C59 PDFBibTeX XMLCite \textit{A. Legrain} et al., Math. Program. Comput. 12, No. 3, 417--450 (2020; Zbl 1452.90223) Full Text: DOI HAL
Deleplanque, Samuel; Labbé, Martine; Ponce, Diego; Puerto, Justo A branch-price-and-cut procedure for the discrete ordered Median problem. (English) Zbl 1451.90085 INFORMS J. Comput. 32, No. 3, 582-599 (2020). MSC: 90B80 90C57 PDFBibTeX XMLCite \textit{S. Deleplanque} et al., INFORMS J. Comput. 32, No. 3, 582--599 (2020; Zbl 1451.90085) Full Text: DOI arXiv Link
Zhang, Zheng; Denton, Brian T.; Xie, Xiaolan Branch and price for chance-constrained bin packing. (English) Zbl 07290862 INFORMS J. Comput. 32, No. 3, 547-564 (2020). MSC: 90Cxx PDFBibTeX XMLCite \textit{Z. Zhang} et al., INFORMS J. Comput. 32, No. 3, 547--564 (2020; Zbl 07290862) Full Text: DOI
Wei, Lijun; Luo, Zhixing; Baldacci, Roberto; Lim, Andrew A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems. (English) Zbl 07290855 INFORMS J. Comput. 32, No. 2, 428-443 (2020). MSC: 90Cxx PDFBibTeX XMLCite \textit{L. Wei} et al., INFORMS J. Comput. 32, No. 2, 428--443 (2020; Zbl 07290855) Full Text: DOI
Wu, Lingxiao; Jia, Shuai; Wang, Shuaian Pilotage planning in seaports. (English) Zbl 1443.90196 Eur. J. Oper. Res. 287, No. 1, 90-105 (2020). MSC: 90B35 90C11 90C39 PDFBibTeX XMLCite \textit{L. Wu} et al., Eur. J. Oper. Res. 287, No. 1, 90--105 (2020; Zbl 1443.90196) Full Text: DOI
Allman, Andrew; Zhang, Qi Dynamic location of modular manufacturing facilities with relocation of individual modules. (English) Zbl 1443.90236 Eur. J. Oper. Res. 286, No. 2, 494-507 (2020). MSC: 90B80 PDFBibTeX XMLCite \textit{A. Allman} and \textit{Q. Zhang}, Eur. J. Oper. Res. 286, No. 2, 494--507 (2020; Zbl 1443.90236) Full Text: DOI
Park, Youngsoo; Nielsen, Peter; Moon, Ilkyeong Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint. (English) Zbl 1458.90452 Comput. Oper. Res. 119, Article ID 104936, 18 p. (2020). MSC: 90B80 90C11 90C57 PDFBibTeX XMLCite \textit{Y. Park} et al., Comput. Oper. Res. 119, Article ID 104936, 18 p. (2020; Zbl 1458.90452) Full Text: DOI
Hosseininasab, Amin; Gzara, Fatma Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem. (English) Zbl 1433.90081 Optim. Lett. 14, No. 1, 171-193 (2020). MSC: 90B80 90B10 90C15 PDFBibTeX XMLCite \textit{A. Hosseininasab} and \textit{F. Gzara}, Optim. Lett. 14, No. 1, 171--193 (2020; Zbl 1433.90081) Full Text: DOI
Homsi, Gabriel; Martinelli, Rafael; Vidal, Thibaut; Fagerholt, Kjetil Industrial and tramp ship routing problems: closing the gap for real-scale instances. (English) Zbl 1441.90032 Eur. J. Oper. Res. 283, No. 3, 972-990 (2020). MSC: 90B06 90B35 90C57 90C59 90C35 PDFBibTeX XMLCite \textit{G. Homsi} et al., Eur. J. Oper. Res. 283, No. 3, 972--990 (2020; Zbl 1441.90032) Full Text: DOI arXiv
Tilk, Christian; Goel, Asvin Bidirectional labeling for solving vehicle routing and truck driver scheduling problems. (English) Zbl 1431.90071 Eur. J. Oper. Res. 283, No. 1, 108-124 (2020). MSC: 90B35 90B06 90C57 PDFBibTeX XMLCite \textit{C. Tilk} and \textit{A. Goel}, Eur. J. Oper. Res. 283, No. 1, 108--124 (2020; Zbl 1431.90071) Full Text: DOI
Melchiori, Anna; Sgalambro, Antonino A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem. (English) Zbl 1431.90036 Eur. J. Oper. Res. 282, No. 3, 846-857 (2020). MSC: 90B10 90C27 90C35 PDFBibTeX XMLCite \textit{A. Melchiori} and \textit{A. Sgalambro}, Eur. J. Oper. Res. 282, No. 3, 846--857 (2020; Zbl 1431.90036) Full Text: DOI
Dell’Amico, Mauro; Furini, Fabio; Iori, Manuel A branch-and-price algorithm for the temporal bin packing problem. (English) Zbl 1458.90543 Comput. Oper. Res. 114, Article ID 104825, 16 p. (2020). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{M. Dell'Amico} et al., Comput. Oper. Res. 114, Article ID 104825, 16 p. (2020; Zbl 1458.90543) Full Text: DOI arXiv
Wei, Lijun; Lai, Minghui; Lim, Andrew; Hu, Qian A branch-and-price algorithm for the two-dimensional vector packing problem. (English) Zbl 1430.90425 Eur. J. Oper. Res. 281, No. 1, 25-35 (2020). MSC: 90C10 05C70 PDFBibTeX XMLCite \textit{L. Wei} et al., Eur. J. Oper. Res. 281, No. 1, 25--35 (2020; Zbl 1430.90425) Full Text: DOI
Van Den Eeckhout, M.; Vanhoucke, M.; Maenhout, B. A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems. (English) Zbl 1430.90368 Eur. J. Oper. Res. 280, No. 3, 845-859 (2020). MSC: 90B70 90B35 90C10 PDFBibTeX XMLCite \textit{M. Van Den Eeckhout} et al., Eur. J. Oper. Res. 280, No. 3, 845--859 (2020; Zbl 1430.90368) Full Text: DOI Link
Hintsch, Timo; Irnich, Stefan Exact solution of the soft-clustered vehicle-routing problem. (English) Zbl 1430.90090 Eur. J. Oper. Res. 280, No. 1, 164-178 (2020). MSC: 90B06 90B10 90C10 90C39 90C35 PDFBibTeX XMLCite \textit{T. Hintsch} and \textit{S. Irnich}, Eur. J. Oper. Res. 280, No. 1, 164--178 (2020; Zbl 1430.90090) Full Text: DOI Link