Ötken, Çelen Naz; Yıldız, Barış; Arslan, Okan; Laporte, Gilbert Making opportunity sales in attended home delivery. (English) Zbl 07764409 Comput. Oper. Res. 160, Article ID 106362, 19 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{Ç. N. Ötken} et al., Comput. Oper. Res. 160, Article ID 106362, 19 p. (2023; Zbl 07764409) Full Text: DOI
Shaabani, Homayoun; Hoff, Arild; Hvattum, Lars Magnus; Laporte, Gilbert A matheuristic for the multi-product maritime inventory routing problem. (English) Zbl 07706724 Comput. Oper. Res. 154, Article ID 106214, 19 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{H. Shaabani} et al., Comput. Oper. Res. 154, Article ID 106214, 19 p. (2023; Zbl 07706724) Full Text: DOI
Keskin, Merve; Laporte, Gilbert; Çatay, Bülent Electric vehicle routing problem with time-dependent waiting times at recharging stations. (English) Zbl 1458.90106 Comput. Oper. Res. 107, 77-94 (2019). MSC: 90B06 90C59 PDFBibTeX XMLCite \textit{M. Keskin} et al., Comput. Oper. Res. 107, 77--94 (2019; Zbl 1458.90106) Full Text: DOI Link
Wøhlk, Sanne; Laporte, Gilbert Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs. (English) Zbl 1391.90622 Comput. Oper. Res. 87, 107-113 (2017). MSC: 90C35 05C70 05C85 90C27 90C11 90C59 PDFBibTeX XMLCite \textit{S. Wøhlk} and \textit{G. Laporte}, Comput. Oper. Res. 87, 107--113 (2017; Zbl 1391.90622) Full Text: DOI Link
Ghiani, Gianpaolo; Laporte, Gilbert; Manni, Emanuele Model-based automatic neighborhood design by unsupervised learning. (English) Zbl 1348.90489 Comput. Oper. Res. 54, 108-116 (2015). MSC: 90C11 68T05 90C59 PDFBibTeX XMLCite \textit{G. Ghiani} et al., Comput. Oper. Res. 54, 108--116 (2015; Zbl 1348.90489) Full Text: DOI
Gutiérrez-Jarpa, Gabriel; Obreque, Carlos; Laporte, Gilbert; Marianov, Vladimir Rapid transit network design for optimal cost and origin-destination demand capture. (English) Zbl 1348.90664 Comput. Oper. Res. 40, No. 12, 3000-3009 (2013). MSC: 90C90 90C35 90B10 PDFBibTeX XMLCite \textit{G. Gutiérrez-Jarpa} et al., Comput. Oper. Res. 40, No. 12, 3000--3009 (2013; Zbl 1348.90664) Full Text: DOI
Bartolini, Enrico; Cordeau, Jean-François; Laporte, Gilbert Improved lower bounds and exact algorithm for the capacitated arc routing problem. (English) Zbl 1262.90100 Math. Program. 137, No. 1-2 (A), 409-452 (2013). MSC: 90C10 90C39 90C57 PDFBibTeX XMLCite \textit{E. Bartolini} et al., Math. Program. 137, No. 1--2 (A), 409--452 (2013; Zbl 1262.90100) Full Text: DOI
Albareda-Sambola, Maria; Fernández, Elena; Laporte, Gilbert A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem. (English) Zbl 1208.90097 Comput. Oper. Res. 38, No. 8, 1109-1116 (2011). MSC: 90B80 PDFBibTeX XMLCite \textit{M. Albareda-Sambola} et al., Comput. Oper. Res. 38, No. 8, 1109--1116 (2011; Zbl 1208.90097) Full Text: DOI
Cordeau, Jean-François; Gaudioso, Manlio; Laporte, Gilbert; Moccia, Luigi A memetic heuristic for the generalized quadratic assignment problem. (English) Zbl 1241.90105 INFORMS J. Comput. 18, No. 4, 433-443 (2006). MSC: 90C27 90C59 90C20 PDFBibTeX XMLCite \textit{J.-F. Cordeau} et al., INFORMS J. Comput. 18, No. 4, 433--443 (2006; Zbl 1241.90105) Full Text: DOI
Moccia, Luigi; Cordeau, Jean-François; Gaudioso, Manlio; Laporte, Gilbert A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal. (English) Zbl 1112.90033 Nav. Res. Logist. 53, No. 1, 45-59 (2006). MSC: 90B35 90C57 PDFBibTeX XMLCite \textit{L. Moccia} et al., Nav. Res. Logist. 53, No. 1, 45--59 (2006; Zbl 1112.90033) Full Text: DOI
Gendreau, Michel; Laporte, Gilbert; Guimarães, Eduardo Morais A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times. (English) Zbl 0989.90062 Eur. J. Oper. Res. 133, No. 1, 183-189 (2001). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{M. Gendreau} et al., Eur. J. Oper. Res. 133, No. 1, 183--189 (2001; Zbl 0989.90062) Full Text: DOI
Ghiani, Gianpaolo; Improta, Gennaro; Laporte, Gilbert The capacitated arc routing problem with intermediate facilities. (English) Zbl 0981.90059 Networks 37, No. 3, 134-143 (2001). MSC: 90C35 90B20 PDFBibTeX XMLCite \textit{G. Ghiani} et al., Networks 37, No. 3, 134--143 (2001; Zbl 0981.90059) Full Text: DOI
Gendreau, Michel; Laporte, Gilbert; Parent, Isabelle Heuristics for the location of inspection stations on a network. (English) Zbl 0968.90020 Nav. Res. Logist. 47, No. 4, 287-303 (2000). MSC: 90B18 90B25 90B40 90C59 PDFBibTeX XMLCite \textit{M. Gendreau} et al., Nav. Res. Logist. 47, No. 4, 287--303 (2000; Zbl 0968.90020) Full Text: DOI
Ghiani, Gianpaolo; Laporte, Gilbert Eulerian location problems. (English) Zbl 0948.90085 Networks 34, No. 4, 291-302 (1999). MSC: 90B85 PDFBibTeX XMLCite \textit{G. Ghiani} and \textit{G. Laporte}, Networks 34, No. 4, 291--302 (1999; Zbl 0948.90085) Full Text: DOI
Laporte, Gilbert; Semet, Frédéric An optimality cut for mixed integer linear programs. (English) Zbl 0938.90053 Eur. J. Oper. Res. 119, No. 3, 671-677 (1999). MSC: 90C11 90C05 PDFBibTeX XMLCite \textit{G. Laporte} and \textit{F. Semet}, Eur. J. Oper. Res. 119, No. 3, 671--677 (1999; Zbl 0938.90053) Full Text: DOI
Labbé, Martine; Laporte, Gilbert; Soriano, Patrick Covering a graph with cycles. (English) Zbl 1040.90555 Comput. Oper. Res. 25, No. 6, 499-504 (1998). MSC: 90C35 05C35 05C38 90C59 05C70 PDFBibTeX XMLCite \textit{M. Labbé} et al., Comput. Oper. Res. 25, No. 6, 499--504 (1998; Zbl 1040.90555) Full Text: DOI