default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGilbert Laporte
Person information
- affiliation: HEC Montréal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j410]Ziru Lin, Xiaofeng Xu, Emrah Demir
, Gilbert Laporte:
Optimizing task assignment and routing operations with a heterogeneous fleet of unmanned aerial vehicles for emergency healthcare services. Comput. Oper. Res. 174: 106890 (2025)- [j409]Li Guan, Gilbert Laporte, José M. Merigó, Stefan Nickel, Iman Rahimi, Francisco Saldanha-da-Gama:
50 years of Computers & Operations Research: A bibliometric analysis. Comput. Oper. Res. 175: 106910 (2025) - [j408]Cagla F. Dursunoglu, Okan Arslan, Sebnem Manolya Demir, Bahar Yetis Kara, Gilbert Laporte:
A unifying framework for selective routing problems. Eur. J. Oper. Res. 320(1): 1-19 (2025) - 2024
- [j407]Christina J. Liepold, Okan Arslan, Gilbert Laporte, Maximilian Schiffer:
The Impact of Partial Production Capacity Sharing via Production as a Service. Comput. Oper. Res. 165: 106587 (2024) - [j406]David Canca, Eva Barrena, Gilbert Laporte:
Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem. Comput. Oper. Res. 166: 106632 (2024) - [j405]Pedram Beldar, Maria Battarra, Gilbert Laporte:
Non-identical parallel machines batch processing problem to minimize the makespan: Models and algorithms. Comput. Oper. Res. 168: 106708 (2024) - [j404]Meike Reusken, Gilbert Laporte, Sonja U. K. Rohmer, Frans Cruijssen:
Vehicle routing with stochastic demand, service and waiting times - The case of food bank collection problems. Eur. J. Oper. Res. 317(1): 111-127 (2024) - [j403]Xuecheng Tian, Shuaian Wang, Gilbert Laporte, Ying Yang:
Determinism versus uncertainty: Examining the worst-case expected performance of data-driven policies. Eur. J. Oper. Res. 318(1): 242-252 (2024) - [j402]Gilbert Laporte:
Fifty years of operational research: 1972-2022. Eur. J. Oper. Res. 319(2): 347-360 (2024) - [j401]Siao-Leu Phouratsamay, Maria Paola Scaparra, Trung Hieu Tran, Gilbert Laporte:
Strategic flood impact mitigation in developing countries' urban road networks: Application to Hanoi. Eur. J. Oper. Res. 319(3): 862-876 (2024) - [j400]Hani Zbib, Burcu Balcik, Marie-Ève Rancourt, Gilbert Laporte:
A Mutual Catastrophe Insurance Framework for Horizontal Collaboration in Prepositioning Strategic Reserves. Oper. Res. 72(5): 2014-2041 (2024) - [j399]Fotios Petropoulos, Gilbert Laporte, Emel Aktas, Sibel A. Alumur, Claudia Archetti, Hayriye Ayhan, Maria Battarra, Julia A. Bennell, Jean-Marie Bourjolly, John E. Boylan, Michèle Breton, David Canca, Laurent Charlin, Bo Chen, Cihan Tugrul Cicek, Louis Anthony Cox, Christine S. M. Currie, Erik Demeulemeester, Li Ding, Stephen M. Disney, Matthias Ehrgott, Martin J. Eppler, Günes Erdogan, Bernard Fortz, L. Alberto Franco, Jens Frische, Salvatore Greco, Amanda J. Gregory, Raimo P. Hämäläinen, Willy Herroelen, Mike Hewitt, Jan Holmström, John N. Hooker, Tugçe Isik, Jill Johnes, Bahar Yetis Kara, Özlem Karsu, Katherine Kent, Charlotte Köhler, Martin H. Kunc, Yong-Hong Kuo, Adam N. Letchford, Janny Leung, Dong Li, Haitao Li, Judit Lienert, Ivana Ljubic, Andrea Lodi, Sebastián Lozano, Virginie Lurkin, Silvano Martello, Ian G. McHale, Gerald Midgley, John D. W. Morecroft, Akshay Mutha, Ceyda Oguz, Sanja Petrovic, Ulrich Pferschy, Harilaos N. Psaraftis, Sam Rose, Lauri Saarinen, Saïd Salhi, Jing-Sheng Song, Dimitrios Sotiros, Kathryn E. Stecke, Arne K. Strauss, Istenç Tarhan, Clemens Thielen, Paolo Toth, Tom Van Woensel, Greet Vanden Berghe, Christos Vasilakis, Vikrant Vaze, Daniele Vigo, Kai Virtanen, Xun Wang, Rafal Weron, Leroy White, Mike Yearworth, E. Alper Yildirim, Georges Zaccour, Xuying Zhao:
Operational Research: methods and applications. J. Oper. Res. Soc. 75(3): 423-617 (2024) - 2023
- [j398]Maryam Haghi, Okan Arslan, Gilbert Laporte:
A location-or-routing problem with partial and decaying coverage. Comput. Oper. Res. 149: 106041 (2023) - [j397]Homayoun Shaabani, Arild Hoff, Lars Magnus Hvattum, Gilbert Laporte:
A matheuristic for the multi-product maritime inventory routing problem. Comput. Oper. Res. 154: 106214 (2023) - [j396]Lu Zhen, Jingwen Wu, Gilbert Laporte, Zheyi Tan:
Heterogeneous instant delivery orders scheduling and routing problem. Comput. Oper. Res. 157: 106246 (2023) - [j395]Çelen Naz Ötken, Baris Yildiz, Okan Arslan, Gilbert Laporte:
Making opportunity sales in attended home delivery. Comput. Oper. Res. 160: 106362 (2023) - [j394]Lu Zhen, Jiajing Gao, Zheyi Tan, Gilbert Laporte, Roberto Baldacci:
Territorial design for customers with demand frequency. Eur. J. Oper. Res. 309(1): 82-101 (2023) - 2022
- [j393]Gilbert Laporte, Paolo Toth:
A gap in scientific reporting. 4OR 20(1): 169-171 (2022) - [j392]David Canca, Gilbert Laporte:
Solving real-size stochastic railway rapid transit network construction scheduling problems. Comput. Oper. Res. 138: 105600 (2022) - [j391]M. Hakan Akyüz, Ibrahim Muter, Günes Erdogan, Gilbert Laporte:
Minimum cost delivery of multi-item orders in e-commerce logistics. Comput. Oper. Res. 138: 105613 (2022) - [j390]Gilbert Laporte, Marie-Ève Rancourt, Jessica Rodríguez-Pereira, Selene Silvestri:
Optimizing access to drinking water in remote areas. Application to Nepal. Comput. Oper. Res. 140: 105669 (2022) - [j389]Sanne Wøhlk, Gilbert Laporte:
Transport of skips between recycling centers and treatment facilities. Comput. Oper. Res. 145: 105879 (2022) - [j388]Oliver Thomasson, Maria Battarra, Günes Erdogan, Gilbert Laporte:
Pallet location and job scheduling in a Twin-Robot system. Comput. Oper. Res. 147: 105956 (2022) - [j387]Liyang Xiao, Lu Zhen, Gilbert Laporte, Roberto Baldacci, Chenghao Wang:
A column generation-based heuristic for a rehabilitation patient scheduling and routing problem. Comput. Oper. Res. 148: 105970 (2022) - [j386]Borzou Rostami, Masoud Chitsaz, Okan Arslan, Gilbert Laporte, Andrea Lodi:
Single Allocation Hub Location with Heterogeneous Economies of Scale. Oper. Res. 70(2): 766-785 (2022) - [j385]Maximilian Schiffer, Nils Boysen, Patrick S. Klein, Gilbert Laporte, Marco Pavone:
Optimal Picking Policies in E-Commerce Warehouses. Manag. Sci. 68(10): 7497-7517 (2022) - [j384]Luigi Moccia, Duncan W. Allen, Gilbert Laporte, Andrea Spinosa:
Mode boundaries of automated metro and semi-rapid rail in urban transit. Public Transp. 14(3): 739-802 (2022) - [j383]Aurélien Froger, Ola Jabali, Jorge E. Mendoza, Gilbert Laporte:
The Electric Vehicle Routing Problem with Capacitated Charging Stations. Transp. Sci. 56(2): 460-482 (2022) - 2021
- [j382]Merve Keskin, Bülent Çatay, Gilbert Laporte:
A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations. Comput. Oper. Res. 125: 105060 (2021) - [j381]Marko Mladenovic, Thierry Delot, Gilbert Laporte, Christophe Wilbaut:
A scalable dynamic parking allocation framework. Comput. Oper. Res. 125: 105080 (2021) - [j380]Demetrio Laganà, Gilbert Laporte, Francesca Vocaturo:
A dynamic multi-period general routing problem arising in postal service and parcel delivery systems. Comput. Oper. Res. 129: 105195 (2021) - [j379]Gilbert Laporte:
Some contributions of Ailsa H. Land to the study of the traveling salesman problem. EURO J. Comput. Optim. 9: 100018 (2021) - [j378]Maximilian Schiffer, Patrick S. Klein, Gilbert Laporte, Grit Walther:
Integrated planning for electric commercial vehicle fleets: A case study for retail mid-haul logistics networks. Eur. J. Oper. Res. 291(3): 944-960 (2021) - [j377]Marc-Antoine Coindreau, Olivier Gallay, Nicolas Zufferey, Gilbert Laporte:
Inbound and outbound flow integration for cross-docking operations. Eur. J. Oper. Res. 294(3): 1153-1163 (2021) - [j376]Bruno Salezza Vieira, Glaydston Mattos Ribeiro, Laura Bahiense, Roberto Edward Cruz, André Bergsten Mendes, Gilbert Laporte:
Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions. Eur. J. Oper. Res. 295(3): 908-923 (2021) - [j375]Yauheni Kisialiou, Irina V. Gribkovskaia, Gilbert Laporte:
Periodic supply vessel planning under demand and weather uncertainty. INFOR Inf. Syst. Oper. Res. 59(3): 411-438 (2021) - [j374]Giuseppe Bruno, Manuel Cavola, Antonio Diglio, Gilbert Laporte, Carmela Piccolo:
Reorganizing postal collection operations in urban areas as a result of declining mail volumes - A case study in Bologna. J. Oper. Res. Soc. 72(7): 1591-1606 (2021) - [j373]Maria Battarra, Federico Fraboni, Oliver Thomasson, Günes Erdogan, Gilbert Laporte, Marco Formentini:
Algorithms for the Calzedonia workload allocation problem. J. Oper. Res. Soc. 72(9): 2004-2017 (2021) - [j372]Hao Yu, Xu Sun, Wei Deng Solvang, Gilbert Laporte:
Solving a Real-World Urban Postal Service System Redesign Problem. Sci. Program. 2021: 3058472:1-3058472:17 (2021) - 2020
- [j371]Giusy Macrina, Luigi Di Puglia Pugliese, Francesca Guerriero, Gilbert Laporte:
Crowd-shipping with time windows and transshipment nodes. Comput. Oper. Res. 113 (2020) - [j370]Çagri Koç, Gilbert Laporte, Ilknur Tükenmez:
A review of vehicle routing with simultaneous pickup and delivery. Comput. Oper. Res. 122: 104987 (2020) - [j369]Hani Zbib, Gilbert Laporte:
The commodity-split multi-compartment capacitated arc routing problem. Comput. Oper. Res. 122: 104994 (2020) - [j368]Thibaut Vidal, Gilbert Laporte, Piotr Matl:
A concise guide to existing and emerging vehicle routing problem variants. Eur. J. Oper. Res. 286(2): 401-416 (2020) - [j367]Marko Mladenovic, Thierry Delot, Gilbert Laporte, Christophe Wilbaut:
The parking allocation problem for connected vehicles. J. Heuristics 26(3): 377-399 (2020) - [j366]Okan Arslan, Ola Jabali, Gilbert Laporte:
A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints. INFORMS J. Comput. 32(1): 120-134 (2020) - [j365]Luigi Moccia, Duncan W. Allen, Gilbert Laporte:
A spatially disaggregated model for the technology selection and design of a transit line. Public Transp. 12(3): 647-691 (2020)
2010 – 2019
- 2019
- [j364]David Canca, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa:
The railway rapid transit network construction scheduling problem. Comput. Ind. Eng. 138 (2019) - [j363]Giusy Macrina, Luigi Di Puglia Pugliese, Francesca Guerriero, Gilbert Laporte:
The green mixed fleet vehicle routing problem with partial battery recharging and time windows. Comput. Oper. Res. 101: 183-199 (2019) - [j362]Aurélien Froger, Jorge E. Mendoza, Ola Jabali, Gilbert Laporte:
Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions. Comput. Oper. Res. 104: 256-294 (2019) - [j361]Lu Zhen, Shuaian Wang, Gilbert Laporte, Yi Hu:
Integrated planning of ship deployment, service schedule and container routing. Comput. Oper. Res. 104: 304-318 (2019) - [j360]Lu Zhen, Miao Li, Gilbert Laporte, Wencheng Wang:
A vehicle routing problem arising in unmanned aerial monitoring. Comput. Oper. Res. 105: 1-11 (2019) - [j359]Marilène Cherkesly, Mercedes Landete, Gilbert Laporte:
Median and covering location problems with interconnected facilities. Comput. Oper. Res. 107: 1-18 (2019) - [j358]Merve Keskin, Gilbert Laporte, Bülent Çatay:
Electric Vehicle Routing Problem with Time-Dependent Waiting Times at Recharging Stations. Comput. Oper. Res. 107: 77-94 (2019) - [j357]Sonja U. K. Rohmer, G. D. H. Claassen, Gilbert Laporte:
A two-echelon inventory routing problem for perishable products. Comput. Oper. Res. 107: 156-172 (2019) - [j356]Sanne Wøhlk, Gilbert Laporte:
A districting-based heuristic for the coordinated capacitated arc routing problem. Comput. Oper. Res. 111: 271-284 (2019) - [j355]Marc-Antoine Coindreau, Olivier Gallay, Nicolas Zufferey, Gilbert Laporte:
Integrating workload smoothing and inventory reduction in three intermodal logistics platforms of a European car manufacturer. Comput. Oper. Res. 112 (2019) - [j354]Giusy Macrina, Gilbert Laporte, Francesca Guerriero, Luigi Di Puglia Pugliese:
An energy-efficient green-vehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows. Eur. J. Oper. Res. 276(3): 971-982 (2019) - [j353]Jessica Rodríguez-Pereira, Elena Fernández, Gilbert Laporte, Enrique Benavent, Antonio Martinez-Sykora:
The Steiner Traveling Salesman Problem and its extensions. Eur. J. Oper. Res. 278(2): 615-628 (2019) - [j352]Slim Belhaiza, Rym M'Hallah, Ghassen Ben Brahim, Gilbert Laporte:
Three multi-start data-driven evolutionary heuristics for the vehicle routing problem with multiple time windows. J. Heuristics 25(3): 485-515 (2019) - [j351]Çagri Koç, Ola Jabali, Jorge E. Mendoza, Gilbert Laporte:
The electric vehicle routing problem with shared charging stations. Int. Trans. Oper. Res. 26(4): 1211-1243 (2019) - [j350]Maximilian Schiffer, Michael Schneider, Grit Walther, Gilbert Laporte:
Vehicle Routing and Location Routing with Intermediate Stops: A Review. Transp. Sci. 53(2): 319-343 (2019) - [j349]Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte:
An Exact Algorithm for Multilevel Uncapacitated Facility Location. Transp. Sci. 53(4): 1085-1106 (2019) - [j348]Elena Fernández, Gilbert Laporte, Jessica Rodríguez-Pereira:
Exact Solution of Several Families of Location-Arc Routing Problems. Transp. Sci. 53(5): 1313-1333 (2019) - [i2]Leandro C. Coelho, Gilbert Laporte, Arinei Lindbeck, Thibaut Vidal:
Benchmark Instances and Branch-and-Cut Algorithm for the Hashiwokakero Puzzle. CoRR abs/1905.00973 (2019) - [i1]Thibaut Vidal, Gilbert Laporte, Piotr Matl:
A concise guide to existing and emerging vehicle routing problem variants. CoRR abs/1906.06750 (2019) - 2018
- [j347]Gilbert Laporte, Frédéric Meunier, Roberto Wolfler Calvo:
Shared mobility systems: an updated survey. Ann. Oper. Res. 271(1): 105-126 (2018) - [j346]Gabriel Gutiérrez-Jarpa, Gilbert Laporte, Vladimir Marianov:
Corridor-based metro network design with travel flow capture. Comput. Oper. Res. 89: 58-67 (2018) - [j345]Çagri Koç, Gilbert Laporte:
Vehicle routing with backhauls: Review and research perspectives. Comput. Oper. Res. 91: 79-91 (2018) - [j344]Yauheni Kisialiou, Irina Gribkovskaia Sr., Gilbert Laporte:
The periodic supply vessel planning problem with flexible departure times and coupled vessels. Comput. Oper. Res. 94: 52-64 (2018) - [j343]Lei He, Xiaolu Liu, Gilbert Laporte, Yingwu Chen, Yingguo Chen:
An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling. Comput. Oper. Res. 100: 12-25 (2018) - [j342]Moncef Ilies Nasri, Tolga Bektas, Gilbert Laporte:
Route and speed optimization for autonomous trucks. Comput. Oper. Res. 100: 89-101 (2018) - [j341]Teobaldo L. Bulhões Júnior, Anand Subramanian, Günes Erdogan, Gilbert Laporte:
The static bike relocation problem with multiple vehicles and visits. Eur. J. Oper. Res. 264(2): 508-523 (2018) - [j340]Maximilian Schiffer, Michael Schneider, Gilbert Laporte:
Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities. Eur. J. Oper. Res. 265(2): 517-532 (2018) - [j339]Vitor Nesello, Anand Subramanian, Maria Battarra, Gilbert Laporte:
Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times. Eur. J. Oper. Res. 266(2): 498-507 (2018) - [j338]Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte:
Multi-level facility location problems. Eur. J. Oper. Res. 267(3): 791-805 (2018) - [j337]Oliver Thomasson, Maria Battarra, Günes Erdogan, Gilbert Laporte:
Scheduling twin robots in a palletising problem. Int. J. Prod. Res. 56(1-2): 518-542 (2018) - [j336]Okan Arslan, Ola Jabali, Gilbert Laporte:
Exact Solution of the Evasive Flow Capturing Problem. Oper. Res. 66(6): 1625-1640 (2018) - [j335]Çagri Koç, Ola Jabali, Gilbert Laporte:
Long-haul vehicle routing and scheduling with idling options. J. Oper. Res. Soc. 69(2): 235-246 (2018) - [j334]Sanne Wøhlk, Gilbert Laporte:
A fast heuristic for large-scale capacitated arc routing problems. J. Oper. Res. Soc. 69(12): 1877-1887 (2018) - [j333]Elena Fernández, Gilbert Laporte, Jessica Rodríguez-Pereira:
A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem. Transp. Sci. 52(2): 353-369 (2018) - [j332]Ángel Corberán, Günes Erdogan, Gilbert Laporte, Isaac Plana, José M. Sanchis:
The Chinese Postman Problem with Load-Dependent Costs. Transp. Sci. 52(2): 370-385 (2018) - [j331]Anna Franceschetti, Dorothée Honhon, Gilbert Laporte, Tom Van Woensel:
A Shortest-Path Algorithm for the Departure Time and Speed Optimization Problem. Transp. Sci. 52(4): 756-768 (2018) - [j330]Kai Wang, Lu Zhen, Shuaian Wang, Gilbert Laporte:
Column Generation for the Integrated Berth Allocation, Quay Crane Assignment, and Yard Assignment Problem. Transp. Sci. 52(4): 812-834 (2018) - 2017
- [j329]David A. Flores-Garza, M. Angélica Salazar-Aguilar, Sandra Ulrich Ngueveu, Gilbert Laporte:
The multi-vehicle cumulative covering tour problem. Ann. Oper. Res. 258(2): 761-780 (2017) - [j328]Pamela J. Palomo-Martínez, M. Angélica Salazar-Aguilar, Gilbert Laporte:
Planning a selective delivery schedule through Adaptive Large Neighborhood Search. Comput. Ind. Eng. 112: 368-378 (2017) - [j327]Marjolein Veenstra, Marilène Cherkesly, Guy Desaulniers, Gilbert Laporte:
The pickup and delivery problem with time windows and handling operations. Comput. Oper. Res. 77: 127-140 (2017) - [j326]Yousef Maknoon, Gilbert Laporte:
Vehicle routing with cross-dock selection. Comput. Oper. Res. 77: 254-266 (2017) - [j325]David Canca, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa:
An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem. Comput. Oper. Res. 78: 1-14 (2017) - [j324]Gabriel Gutiérrez-Jarpa, Gilbert Laporte, Vladimir Marianov, Luigi Moccia:
Multi-objective rapid transit network design with modal competition: The case of Concepción, Chile. Comput. Oper. Res. 78: 27-43 (2017) - [j323]Pamela J. Palomo-Martínez, M. Angélica Salazar-Aguilar, Gilbert Laporte, André Langevin:
A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraints. Comput. Oper. Res. 78: 408-419 (2017) - [j322]Eirik Fernández Cuesta, Henrik Andersson, Kjetil Fagerholt, Gilbert Laporte:
Vessel routing with pickups and deliveries: An application to the supply of offshore oil platforms. Comput. Oper. Res. 79: 140-147 (2017) - [j321]Selene Silvestri, Gilbert Laporte, Raffaele Cerulli:
A branch-and-cut algorithm for the minimum branch vertices spanning tree problem. Comput. Oper. Res. 81: 322-332 (2017) - [j320]Xiaolu Liu, Gilbert Laporte, Yingwu Chen, Renjie He:
An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time. Comput. Oper. Res. 86: 41-53 (2017) - [j319]Sanne Wøhlk, Gilbert Laporte:
Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs. Comput. Oper. Res. 87: 107-113 (2017) - [j318]Andreza Cristina Beezão, Jean-François Cordeau, Gilbert Laporte, Horacio Hideki Yanasse:
Scheduling identical parallel machines with tooling constraints. Eur. J. Oper. Res. 257(3): 834-844 (2017) - [j317]Anna Franceschetti, Emrah Demir, Dorothée Honhon, Tom Van Woensel, Gilbert Laporte, Mark Stobbe:
A metaheuristic for the time-dependent pollution-routing problem. Eur. J. Oper. Res. 259(3): 972-991 (2017) - [j316]Dimitris C. Paraskevopoulos, Gilbert Laporte, Panagiotis P. Repoussis, Christos D. Tarantilis:
Resource constrained routing and scheduling: Review and research prospects. Eur. J. Oper. Res. 263(3): 737-754 (2017) - [j315]Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte:
Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location. INFORMS J. Comput. 29(4): 767-779 (2017) - [j314]Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa, Federico Perea:
The railway line frequency and size setting problem. Public Transp. 9(1-2): 33-53 (2017) - 2016
- [j313]Gilbert Laporte:
Scheduling issues in vehicle routing. Ann. Oper. Res. 236(2): 463-474 (2016) - [j312]David Canca, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa:
A general rapid network design, line planning and fleet investment integrated model. Ann. Oper. Res. 246(1-2): 127-144 (2016) - [j311]David Canca, Eva Barrena, Gilbert Laporte, Francisco A. Ortega:
A short-turning policy for the management of demand disruptions in rapid transit systems. Ann. Oper. Res. 246(1-2): 145-166 (2016) - [j310]Glaydston Mattos Ribeiro, Geraldo Regis Mauri, Saulo de Castro Beluco, Luiz Antonio Nogueira Lorena, Gilbert Laporte:
Berth allocation in an ore terminal with demurrage, despatch and maintenance. Comput. Ind. Eng. 96: 8-15 (2016) - [j309]Karine Sinclair, Jean-François Cordeau, Gilbert Laporte:
A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem. Comput. Oper. Res. 65: 42-52 (2016) - [j308]Hongtao Lei, Rui Wang, Gilbert Laporte:
Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm. Comput. Oper. Res. 67: 12-24 (2016) - [j307]Geraldo Regis Mauri, Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lorena, Gilbert Laporte:
An adaptive large neighborhood search for the discrete and continuous Berth allocation problem. Comput. Oper. Res. 70: 140-154 (2016) - [j306]Alper Ekrem Murat, Gilbert Laporte, Vedat Verter:
A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand. Comput. Oper. Res. 71: 1-15 (2016) - [j305]Çagri Koç, Tolga Bektas, Ola Jabali, Gilbert Laporte:
The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm. Eur. J. Oper. Res. 248(1): 33-51 (2016) - [j304]Duygu Tas, Michel Gendreau, Ola Jabali, Gilbert Laporte:
The traveling salesman problem with time-dependent service times. Eur. J. Oper. Res. 248(2): 372-383 (2016) - [j303]Çagri Koç, Tolga Bektas, Ola Jabali, Gilbert Laporte:
Thirty years of heterogeneous vehicle routing. Eur. J. Oper. Res. 249(1): 1-21 (2016) - [j302]Marilène Cherkesly, Guy Desaulniers, Stefan Irnich, Gilbert Laporte:
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks. Eur. J. Oper. Res. 250(3): 782-793 (2016) - [j301]Ahmad Hemmati, Lars Magnus Hvattum, Marielle Christiansen, Gilbert Laporte:
An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem. Eur. J. Oper. Res. 252(3): 775-788 (2016) - [j300]Günes Erdogan, Gilbert Laporte, Antonio M. Rodríguez-Chía:
Exact and heuristic algorithms for the Hamiltonian p-median problem. Eur. J. Oper. Res. 253(2): 280-289 (2016) - [j299]François V. Louveaux, Yasemin Arda, Yves Crama, Gilbert Laporte:
Large neighborhood search for multi-trip vehicle routing. Eur. J. Oper. Res. 255(2): 422-441 (2016) - [j298]Leandro C. Coelho, Jacques Renaud, Gilbert Laporte:
Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015. INFOR Inf. Syst. Oper. Res. 54(2): 79-96 (2016) - [j297]Oguz Solyali, Jean-François Cordeau, Gilbert Laporte:
The Impact of Modeling on Robust Inventory Management Under Demand Uncertainty. Manag. Sci. 62(4): 1188-1201 (2016) - [j296]Raúl M. Falcón, Eva Barrena, David Canca, Gilbert Laporte:
Counting and enumerating feasible rotating schedules by means of Gröbner bases. Math. Comput. Simul. 125: 139-151 (2016) - [j295]Selene Silvestri, Gilbert Laporte, Raffaele Cerulli:
The Rainbow Cycle Cover Problem. Networks 68(4): 260-270 (2016) - [j294]Samuel Pelletier, Ola Jabali, Gilbert Laporte:
50th Anniversary Invited Article - Goods Distribution with Electric Vehicles: Review and Research Perspectives. Transp. Sci. 50(1): 3-22 (2016) - [j293]Roel G. van Anholt, Leandro C. Coelho, Gilbert Laporte, Iris F. A. Vis:
An Inventory-Routing Problem with Pickups and Deliveries Arising in the Replenishment of Automated Teller Machines. Transp. Sci. 50(3): 1077-1091 (2016) - 2015
- [j292]Gilbert Laporte, Frédéric Meunier, Roberto Wolfler Calvo:
Shared mobility systems. 4OR 13(4): 341-360 (2015) - [j291]Mayron César O. Moreira, Jean-François Cordeau, Alysson M. Costa, Gilbert Laporte:
Robust assembly line balancing with heterogeneous workers. Comput. Ind. Eng. 88: 254-263 (2015) - [j290]Gianpaolo Ghiani, Gilbert Laporte, Emanuele Manni:
Model-based automatic neighborhood design by unsupervised learning. Comput. Oper. Res. 54: 108-116 (2015) - [j289]Tolga Bektas, Gilbert Laporte, Daniele Vigo:
Integrated vehicle routing problems. Comput. Oper. Res. 55: 126 (2015) - [j288]Marie-Ève Rancourt, Jean-François Cordeau, Gilbert Laporte, Ben Watkins:
Tactical network planning for food aid distribution in Kenya. Comput. Oper. Res. 56: 68-83 (2015) - [j287]Hongtao Lei, Gilbert Laporte, Yajie Liu, Tao Zhang:
Dynamic design of sales territories. Comput. Oper. Res. 56: 84-92 (2015) - [j286]Marilène Cherkesly, Guy Desaulniers, Gilbert Laporte:
A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading. Comput. Oper. Res. 62: 23-35 (2015) - [j285]Gilbert Laporte, Marta M. B. Pascoal:
Path based algorithms for metro network design. Comput. Oper. Res. 62: 78-94 (2015) - [j284]Çagri Koç, Tolga Bektas, Ola Jabali, Gilbert Laporte:
A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows. Comput. Oper. Res. 64: 11-27 (2015) - [j283]Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte:
The Minimum Flow Cost Hamiltonian Cycle Problem: A comparison of formulations. Discret. Appl. Math. 187: 140-154 (2015) - [j282]Leandro C. Coelho, Gilbert Laporte:
Classification, models and exact algorithms for multi-compartment delivery problems. Eur. J. Oper. Res. 242(3): 854-864 (2015) - [j281]Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte:
Multi-level facility location as the maximization of a submodular set function. Eur. J. Oper. Res. 247(3): 1013-1016 (2015) - [j280]Laure Cabantous, Gilbert Laporte:
ASP, The Art and Science of Practice: Academia-Industry Interfacing in Operations Research in Montréal. Interfaces 45(6): 554-566 (2015) - [j279]Eva Barrena, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa:
Transferability of collective transportation line networks from a topological and passenger demand perspective. Networks Heterog. Media 10(1): 1-16 (2015) - [j278]Amir Hossein Gharehgozli, Gilbert Laporte, Yugang Yu, René M. B. M. de Koster:
Scheduling Twin Yard Cranes in a Container Block. Transp. Sci. 49(3): 686-705 (2015) - [j277]Marilène Cherkesly, Guy Desaulniers, Gilbert Laporte:
Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading. Transp. Sci. 49(4): 752-766 (2015) - [c8]Gabriel Gutiérrez-Jarpa, Gilbert Laporte, Vladimir Marianov, Luigi Moccia:
A Mixed Integer Linear Program for the Rapid Transit Network Design Problem with Static Modal Competition (Short Paper). ATMOS 2015: 95-96 - [c7]Yousef Ghiami, Tom Van Woensel, Marielle Christiansen, Gilbert Laporte:
A Combined Liquefied Natural Gas Routing and Deteriorating Inventory Management Problem. ICCL 2015: 91-104 - 2014
- [j276]M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte:
The multi-district team orienteering problem. Comput. Oper. Res. 41: 76-82 (2014) - [j275]Eva Barrena, David Canca, Leandro C. Coelho, Gilbert Laporte:
Exact formulations and algorithm for the train timetabling problem with dynamic demand. Comput. Oper. Res. 44: 66-74 (2014) - [j274]Leandro C. Coelho, Gilbert Laporte:
Optimal joint replenishment, delivery and inventory management policies for perishable products. Comput. Oper. Res. 47: 42-52 (2014) - [j273]Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte:
The dynamic multiperiod vehicle routing problem with probabilistic information. Comput. Oper. Res. 48: 31-39 (2014) - [j272]Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte:
Heuristics for dynamic and stochastic inventory-routing. Comput. Oper. Res. 52: 55-67 (2014) - [j271]Slim Belhaiza, Pierre Hansen, Gilbert Laporte:
A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows. Comput. Oper. Res. 52: 269-281 (2014) - [j270]Ola Jabali, Walter Rei, Michel Gendreau, Gilbert Laporte:
Partial-route inequalities for the multi-vehicle routing problem with stochastic demands. Discret. Appl. Math. 177: 121-136 (2014) - [j269]Emrah Demir, Tolga Bektas, Gilbert Laporte:
The bi-objective Pollution-Routing Problem. Eur. J. Oper. Res. 232(3): 464-478 (2014) - [j268]Karine Sinclair, Jean-François Cordeau, Gilbert Laporte:
Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem. Eur. J. Oper. Res. 233(1): 234-245 (2014) - [j267]Emrah Demir, Tolga Bektas, Gilbert Laporte:
A review of recent research on green road freight transportation. Eur. J. Oper. Res. 237(3): 775-793 (2014) - [j266]Günes Erdogan, Gilbert Laporte, Roberto Wolfler Calvo:
The static bicycle relocation problem with demand intervals. Eur. J. Oper. Res. 238(2): 451-457 (2014) - [j265]Gilbert Laporte:
The Tube Challenge. INFOR Inf. Syst. Oper. Res. 52(1): 10-13 (2014) - [j264]Alexander Butsch, Jörg Kalcsics, Gilbert Laporte:
Districting for Arc Routing. INFORMS J. Comput. 26(4): 809-824 (2014) - [j263]Min Wen, Gilbert Laporte, Oli B. G. Madsen, Anders V. Nørrelund, Allan Olsen:
Locating replenishment stations for electric vehicles: application to Danish traffic data. J. Oper. Res. Soc. 65(10): 1555-1561 (2014) - [j262]Leandro C. Coelho, Gilbert Laporte:
A comparison of several enumerative algorithms for Sudoku. J. Oper. Res. Soc. 65(10): 1602-1610 (2014) - [j261]Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Gilbert Laporte, Dilson Lucas Pereira, Adam Wojciechowski:
A comparison of several models for the hamiltonian p-median problem. Networks 63(4): 350-363 (2014) - [j260]Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte:
Thirty Years of Inventory Routing. Transp. Sci. 48(1): 1-19 (2014) - [j259]Ibrahim Muter, Jean-François Cordeau, Gilbert Laporte:
A Branch-and-Price Algorithm for the Multidepot Vehicle Routing Problem with Interdepot Routes. Transp. Sci. 48(3): 425-441 (2014) - [c6]Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa, Federico Perea:
Simultaneous frequency and capacity setting for rapid transit systems with a competing mode and capacity constraints. ATMOS 2014: 107-121 - [p6]Gilbert Laporte, Stefan Ropke, Thibaut Vidal:
Heuristics for the Vehicle Routing Problem. Vehicle Routing 2014: 87-116 - 2013
- [j258]Leandro C. Coelho, Gilbert Laporte:
The exact solution of several classes of inventory-routing problems. Comput. Oper. Res. 40(2): 558-565 (2013) - [j257]M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte:
The synchronized arc and node routing problem: Application to road marking. Comput. Oper. Res. 40(7): 1708-1715 (2013) - [j256]Gabriel Gutiérrez-Jarpa, Carlos Obreque, Gilbert Laporte, Vladimir Marianov:
Rapid transit network design for optimal cost and origin-destination demand capture. Comput. Oper. Res. 40(12): 3000-3009 (2013) - [j255]Gilbert Laporte, Paolo Toth, Daniele Vigo:
Vehicle routing: historical perspective and recent contributions. EURO J. Transp. Logist. 2(1-2): 1-4 (2013) - [j254]Verena Schmid, Karl F. Doerner, Gilbert Laporte:
Rich routing problems arising in supply chain management. Eur. J. Oper. Res. 224(3): 435-448 (2013) - [j253]Enrico Bartolini, Jean-François Cordeau, Gilbert Laporte:
An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand. Oper. Res. 61(2): 315-327 (2013) - [j252]Enrico Bartolini, Jean-François Cordeau, Gilbert Laporte:
Improved lower bounds and exact algorithm for the capacitated arc routing problem. Math. Program. 137(1-2): 409-452 (2013) - [j251]Günes Erdogan, Gilbert Laporte:
The orienteering problem with variable profits. Networks 61(2): 104-116 (2013) - [j250]Lars Magnus Hvattum, Inge Norstad, Kjetil Fagerholt, Gilbert Laporte:
Analysis of an exact algorithm for the vessel speed optimization problem. Networks 62(2): 132-135 (2013) - [j249]Marie-Ève Rancourt, Jean-François Cordeau, Gilbert Laporte:
Long-Haul Vehicle Routing and Scheduling with Working Hour Rules. Transp. Sci. 47(1): 81-107 (2013) - 2012
- [j248]Glaydston Mattos Ribeiro, Gilbert Laporte:
An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 39(3): 728-735 (2012) - [j247]Günes Erdogan, Maria Battarra, Gilbert Laporte, Daniele Vigo:
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs. Comput. Oper. Res. 39(5): 1074-1086 (2012) - [j246]M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte:
Synchronized arc routing for snow plowing operations. Comput. Oper. Res. 39(7): 1432-1440 (2012) - [j245]Jørgen Glomvik Rakke, Marielle Christiansen, Kjetil Fagerholt, Gilbert Laporte:
The Traveling Salesman Problem with Draft Limits. Comput. Oper. Res. 39(9): 2161-2167 (2012) - [j244]Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte:
The inventory-routing problem with transshipment. Comput. Oper. Res. 39(11): 2537-2548 (2012) - [j243]Hongtao Lei, Gilbert Laporte, Bo Guo:
Districting for routing with stochastic customers. EURO J. Transp. Logist. 1(1-2): 67-85 (2012) - [j242]Glaydston Mattos Ribeiro, Gilbert Laporte, Geraldo Regis Mauri:
A comparison of three metaheuristics for the workover rig routing problem. Eur. J. Oper. Res. 220(1): 28-36 (2012) - [j241]Emrah Demir, Tolga Bektas, Gilbert Laporte:
An adaptive large neighborhood search heuristic for the Pollution-Routing Problem. Eur. J. Oper. Res. 223(2): 346-359 (2012) - [j240]Éric Duchêne, Gilbert Laporte, Frédéric Semet:
The undirected m-Capacitated Peripatetic Salesman Problem. Eur. J. Oper. Res. 223(3): 637-643 (2012) - [j239]Hongtao Lei, Gilbert Laporte, Bo Guo:
The Vehicle Routing Problem with Stochastic Demands and Split Deliveries. INFOR Inf. Syst. Oper. Res. 50(2): 59-71 (2012) - [j238]Aliaksandr Shyshou, Irina Gribkovskaia Sr., Gilbert Laporte, Kjetil Fagerholt:
A Large Neighbourhood Search Heuristic for a Periodic Supply Vessel Planning Problem Arising in Offshore Oil and Gas Operations. INFOR Inf. Syst. Oper. Res. 50(4): 195-204 (2012) - [j237]Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte:
A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem. INFORMS J. Comput. 24(3): 343-355 (2012) - [j236]Nicolas Jozefowiez, Gilbert Laporte, Frédéric Semet:
A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem. INFORMS J. Comput. 24(4): 554-564 (2012) - [j235]Luigi Moccia, Jean-François Cordeau, Gilbert Laporte:
An incremental tabu search heuristic for the generalized vehicle routing problem with time windows. J. Oper. Res. Soc. 63(2): 232-244 (2012) - [j234]Sabine Limbourg, Michaël Schyns, Gilbert Laporte:
Automatic aircraft cargo load planning. J. Oper. Res. Soc. 63(9): 1271-1283 (2012) - [j233]Charles Bordenave, Michel Gendreau, Gilbert Laporte:
A branch-and-cut algorithm for the preemptive swapping problem. Networks 59(4): 387-399 (2012) - [j232]Oguz Solyali, Jean-François Cordeau, Gilbert Laporte:
Robust Inventory Routing Under Demand Uncertainty. Transp. Sci. 46(3): 327-340 (2012) - [j231]Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte:
Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels. Transp. Sci. 46(4): 439-459 (2012) - 2011
- [j230]Serge Bisaillon, Jean-François Cordeau, Gilbert Laporte, Federico Pasin:
A large neighbourhood search heuristic for the aircraft and passenger recovery problem. 4OR 9(2): 139-157 (2011) - [j229]Gilbert Laporte, Marta M. B. Pascoal:
Minimum cost path problems with relays. Comput. Oper. Res. 38(1): 165-173 (2011) - [j228]Alper Ekrem Murat, Vedat Verter, Gilbert Laporte:
A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand. Comput. Oper. Res. 38(2): 450-463 (2011) - [j227]Jarl Eirik Korsvik, Kjetil Fagerholt, Gilbert Laporte:
A large neighbourhood search heuristic for ship routing and scheduling with split loads. Comput. Oper. Res. 38(2): 474-483 (2011) - [j226]Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte:
A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem. Comput. Oper. Res. 38(8): 1109-1116 (2011) - [j225]Nicolas Jozefowiez, Gilbert Laporte, Frédéric Semet:
A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants. Comput. Oper. Res. 38(11): 1534-1542 (2011) - [j224]Hongtao Lei, Gilbert Laporte, Bo Guo:
The capacitated vehicle routing problem with stochastic demands and time windows. Comput. Oper. Res. 38(12): 1775-1783 (2011) - [j223]Géraldine Heilporn, Jean-François Cordeau, Gilbert Laporte:
An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays. Discret. Appl. Math. 159(9): 883-895 (2011) - [j222]Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte:
Stochastic uncapacitated hub location. Eur. J. Oper. Res. 212(3): 518-528 (2011) - [j221]Jean-François Cordeau, Gilbert Laporte, Luigi Moccia, Gregorio Sorrentino:
Optimizing yard assignment in an automotive transshipment terminal. Eur. J. Oper. Res. 215(1): 149-160 (2011) - [j220]Burçin Bozkaya, Erhan Erkut, Dan Haight, Gilbert Laporte:
Designing New Electoral Districts for the City of Edmonton. Interfaces 41(6): 534-547 (2011) - [j219]Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte:
Benders Decomposition for Large-Scale Uncapacitated Hub Location. Oper. Res. 59(6): 1477-1490 (2011) - [j218]Luigi Moccia, Jean-François Cordeau, Gilbert Laporte, Stefan Ropke, Maria Pia Valentini:
Modeling and solving a multimodal transportation problem with flexible-time and scheduled services. Networks 57(1): 53-68 (2011) - [j217]Shoshana Anily, Michel Gendreau, Gilbert Laporte:
The preemptive swapping problem on a tree. Networks 58(2): 83-94 (2011) - [j216]Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte:
The Dynamic Uncapacitated Hub Location Problem. Transp. Sci. 45(1): 18-32 (2011) - [c5]M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte:
An Adaptive Large Neighborhood Search Heuristic for a Snow Plowing Problem with Synchronized Routes. INOC 2011: 406-411 - 2010
- [j215]Charles Bordenave, Michel Gendreau, Gilbert Laporte:
Heuristics for the mixed swapping problem. Comput. Oper. Res. 37(1): 108-114 (2010) - [j214]Alper Ekrem Murat, Vedat Verter, Gilbert Laporte:
A continuous analysis framework for the solution of location-allocation problems with dense demand. Comput. Oper. Res. 37(1): 123-136 (2010) - [j213]Min Wen, Jean-François Cordeau, Gilbert Laporte, Jesper Larsen:
The dynamic multi-period vehicle routing problem. Comput. Oper. Res. 37(9): 1615-1623 (2010) - [j212]Günes Erdogan, Jean-François Cordeau, Gilbert Laporte:
A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem. Discret. Appl. Math. 158(15): 1599-1614 (2010) - [j211]Géraldine Heilporn, Jean-François Cordeau, Gilbert Laporte:
The Delivery Man Problem with time windows. Discret. Optim. 7(4): 269-282 (2010) - [j210]Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte:
Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202(1): 8-15 (2010) - [j209]Marie-Claude Bolduc, Gilbert Laporte, Jacques Renaud, Fayez F. Boctor:
A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars. Eur. J. Oper. Res. 202(1): 122-130 (2010) - [j208]Günes Erdogan, Jean-François Cordeau, Gilbert Laporte:
The Attractive Traveling Salesman Problem. Eur. J. Oper. Res. 203(1): 59-69 (2010) - [j207]Gabriel Gutiérrez-Jarpa, Guy Desaulniers, Gilbert Laporte, Vladimir Marianov:
A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows. Eur. J. Oper. Res. 206(2): 341-349 (2010) - [j206]Leizer de Lima Pinto, Gilbert Laporte:
An efficient algorithm for the Steiner Tree Problem with revenue, bottleneck and hop objective functions. Eur. J. Oper. Res. 207(1): 45-49 (2010) - [j205]Gianpaolo Ghiani, Demetrio Laganà, Gilbert Laporte, Francesco Mari:
Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions. J. Heuristics 16(2): 211-233 (2010) - [j204]Gilbert Laporte:
The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization. Int. J. Strateg. Decis. Sci. 1(2): 82-92 (2010) - [j203]Gilbert Laporte:
A concise guide to the Traveling Salesman Problem. J. Oper. Res. Soc. 61(1): 35-40 (2010) - [j202]Tolga Bektas, Gilbert Laporte:
Editorial. J. Oper. Res. Soc. 61(3): 502 (2010) - [j201]Kjetil Fagerholt, Gilbert Laporte, Inge Norstad:
Reducing fuel emissions by optimizing speed on shipping routes. J. Oper. Res. Soc. 61(3): 523-529 (2010) - [j200]Günes Erdogan, Erhan Erkut, Armann Ingolfsson, Gilbert Laporte:
Scheduling ambulance crews for maximum coverage. J. Oper. Res. Soc. 61(4): 543-550 (2010) - [j199]Jarl Eirik Korsvik, Kjetil Fagerholt, Gilbert Laporte:
A tabu search heuristic for ship routing and scheduling. J. Oper. Res. Soc. 61(4): 594-603 (2010) - [j198]Roberto Baldacci, Enrico Bartolini, Gilbert Laporte:
Some applications of the generalized vehicle routing problem. J. Oper. Res. Soc. 61(7): 1072-1077 (2010) - [j197]Irina Dumitrescu, Stefan Ropke, Jean-François Cordeau, Gilbert Laporte:
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm. Math. Program. 121(2): 269-305 (2010) - [j196]Dominique Feillet, Gilbert Laporte, Frédéric Semet:
Preface. Networks 55(1): 1 (2010) - [j195]Jean-François Cordeau, Manuel Iori, Gilbert Laporte, Juan José Salazar González:
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks 55(1): 46-59 (2010) - [j194]Alexandre Beaudry, Gilbert Laporte, M. Teresa Melo, Stefan Nickel:
Dynamic transportation of patients in hospitals. OR Spectr. 32(1): 77-107 (2010) - [j193]Jean-François Cordeau, Gilbert Laporte, Federico Pasin, Stefan Ropke:
Scheduling technicians and tasks in a telecommunications company. J. Sched. 13(4): 393-409 (2010) - [j192]Gilbert Laporte, Roberto Musmanno, Francesca Vocaturo:
An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands. Transp. Sci. 44(1): 125-135 (2010) - [j191]Maria Battarra, Günes Erdogan, Gilbert Laporte, Daniele Vigo:
The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs. Transp. Sci. 44(3): 383-399 (2010)
2000 – 2009
- 2009
- [j190]Julie Paquette, Jean-François Cordeau, Gilbert Laporte:
Quality of service in dial-a-ride operations. Comput. Ind. Eng. 56(4): 1721-1734 (2009) - [j189]Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte:
The capacity and distance constrained plant location problem. Comput. Oper. Res. 36(2): 597-611 (2009) - [j188]Temel Öncan, I. Kuban Altinel, Gilbert Laporte:
A comparative analysis of several asymmetric traveling salesman problem formulations. Comput. Oper. Res. 36(3): 637-654 (2009) - [j187]Fabien Cornillier, Gilbert Laporte, Fayez F. Boctor, Jacques Renaud:
The petrol station replenishment problem with time windows. Comput. Oper. Res. 36(3): 919-935 (2009) - [j186]Günes Erdogan, Jean-François Cordeau, Gilbert Laporte:
The pickup and delivery traveling salesman problem with first-in-first-out loading. Comput. Oper. Res. 36(6): 1800-1808 (2009) - [j185]Arild Hoff, Irina Gribkovskaia Sr., Gilbert Laporte, Arne Løkketangen:
Lasso solution strategies for the vehicle routing problem with pickups and deliveries. Eur. J. Oper. Res. 192(3): 755-766 (2009) - [j184]Souheyl Touhami, Jean-Marie Bourjolly, Gilbert Laporte:
Partial integration of frequency allocation within antenna positioning in GSM mobile networks. Eur. J. Oper. Res. 193(2): 541-551 (2009) - [j183]Ardavan Asef-Vaziri, Gilbert Laporte:
Integration of operational policies into the design phase of a material handling network. Int. J. Adv. Oper. Manag. 1(1): 108-134 (2009) - [j182]Tuyva Chan, Jean-François Cordeau, Gilbert Laporte:
Locating Satellite Yards in Forestry Operations. INFOR Inf. Syst. Oper. Res. 47(3): 223-234 (2009) - [j181]Lars Magnus Hvattum, Arne Løkketangen, Gilbert Laporte:
Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems. INFORMS J. Comput. 21(2): 268-285 (2009) - [j180]Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega, Miguel A. Pozo:
Locating a metro line in a historical city centre: application to Sevilla. J. Oper. Res. Soc. 60(10): 1462-1466 (2009) - [j179]Min Wen, Jesper Larsen, Jens Clausen, Jean-François Cordeau, Gilbert Laporte:
Vehicle routing with cross-docking. J. Oper. Res. Soc. 60(12): 1708-1718 (2009) - [j178]Honora K. Smith, Gilbert Laporte, Paul R. Harper:
Locational analysis: highlights of growth to maturity. J. Oper. Res. Soc. 60(S1) (2009) - [j177]Alysson M. Costa, Jean-François Cordeau, Gilbert Laporte:
Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints. Networks 53(2): 141-159 (2009) - [j176]Éric Duchêne, Gilbert Laporte, Frédéric Semet:
Heuristiques pour le Problème du Vendeur m-Péripatétique. RAIRO Oper. Res. 43(1): 13-26 (2009) - [j175]Teodor Gabriel Crainic, Gilbert Laporte, Vedat Verter:
Guest Editorial - Focused Issue on Freight Transportation. Transp. Sci. 43(2): 127-128 (2009) - [j174]Gilbert Laporte:
Fifty Years of Vehicle Routing. Transp. Sci. 43(4): 408-416 (2009) - [r2]François V. Louveaux, Gilbert Laporte:
Stochastic Vehicle Routing Problems. Encyclopedia of Optimization 2009: 3829-3832 - 2008
- [j173]Irina Gribkovskaia Sr., Gilbert Laporte, Aliaksandr Shyshou:
The single vehicle routing problem with deliveries and selective pickups. Comput. Oper. Res. 35(9): 2908-2924 (2008) - [j172]Tolga Bektas, Jean-François Cordeau, Erhan Erkut, Gilbert Laporte:
Exact algorithms for the joint object placement and request routing problem in content distribution networks. Comput. Oper. Res. 35(12): 3860-3884 (2008) - [j171]Alysson M. Costa, Jean-François Cordeau, Gilbert Laporte:
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints. Eur. J. Oper. Res. 190(1): 68-78 (2008) - [j170]Fabien Cornillier, Fayez F. Boctor, Gilbert Laporte, Jacques Renaud:
A heuristic for the multi-period petrol station replenishment problem. Eur. J. Oper. Res. 191(2): 295-305 (2008) - [j169]Temel Öncan, Jean-François Cordeau, Gilbert Laporte:
A tabu search heuristic for the generalized minimum spanning tree problem. Eur. J. Oper. Res. 191(2): 306-319 (2008) - [j168]Jean-François Cordeau, Gilbert Laporte, Federico Pasin:
Iterated tabu search for the car sequencing problem. Eur. J. Oper. Res. 191(3): 945-956 (2008) - [j167]Gilbert Laporte:
Special Issue of INFOR in Honour of the 50th Anniversary of the Canadian Operational Research Society. INFOR Inf. Syst. Oper. Res. 46(1): 1-2 (2008) - [j166]Vitória Pureza, Gilbert Laporte:
Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows. INFOR Inf. Syst. Oper. Res. 46(3): 165-176 (2008) - [j165]Gilbert Laporte:
Special Issue of INFOR in Honour of the 50th Anniversary of the Canadian Operational Research Society. INFOR Inf. Syst. Oper. Res. 46(4): 219 (2008) - [j164]Gilbert Laporte:
Operational Research: Milestones and Highlights of Canadian Contributions. INFOR Inf. Syst. Oper. Res. 46(4): 309-312 (2008) - [j163]H. Neil Geismar, Gilbert Laporte, Lei Lei, Chelliah Sriskandarajah:
The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan. INFORMS J. Comput. 20(1): 21-33 (2008) - [j162]Jack Brimberg, Pierre Hansen, Gilbert Laporte, Nenad Mladenovic, Dragan Urosevic:
The maximum return-on-investment plant location problem with market share. J. Oper. Res. Soc. 59(3): 399-406 (2008) - [j161]Fabien Cornillier, Fayez F. Boctor, Gilbert Laporte, Jacques Renaud:
An exact algorithm for the petrol station replenishment problem. J. Oper. Res. Soc. 59(5): 607-615 (2008) - [j160]Marie-Claude Bolduc, Jacques Renaud, Fayez F. Boctor, Gilbert Laporte:
A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers. J. Oper. Res. Soc. 59(6): 776-787 (2008) - [j159]Irina V. Gribkovskaia, Gilbert Laporte, A. Shlopak:
A tabu search heuristic for a routing problem arising in servicing of offshore oil and gas platforms. J. Oper. Res. Soc. 59(11): 1449-1459 (2008) - [j158]Edgar Alberto Cabral, Erhan Erkut, Gilbert Laporte, Raymond A. Patterson:
Wide area telecommunication network design: application to the Alberta SuperNet. J. Oper. Res. Soc. 59(11): 1460-1470 (2008) - [j157]Marta Anna Krajewska, Herbert Kopfer, Gilbert Laporte, Stefan Ropke, Georges Zaccour:
Horizontal cooperation among freight carriers: request allocation and profit sharing. J. Oper. Res. Soc. 59(11): 1483-1491 (2008) - [j156]Tolga Bektas, Jean-François Cordeau, Erhan Erkut, Gilbert Laporte:
A two-level simulated annealing algorithm for efficient dissemination of electronic content. J. Oper. Res. Soc. 59(11): 1557-1567 (2008) - [j155]Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello:
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51(1): 4-18 (2008) - [j154]Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello:
Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51(2): 153 (2008) - 2007
- [j153]Jean-François Cordeau, Gilbert Laporte:
The dial-a-ride problem: models and algorithms. Ann. Oper. Res. 153(1): 29-46 (2007) - [j152]Ardavan Asef-Vaziri, Gilbert Laporte, Robert Ortiz:
Exact and heuristic procedures for the material handling circular flow path design problem. Eur. J. Oper. Res. 176(2): 707-726 (2007) - [j151]Benoit Crevier, Jean-François Cordeau, Gilbert Laporte:
The multi-depot vehicle routing problem with inter-depot routes. Eur. J. Oper. Res. 176(2): 756-773 (2007) - [j150]Jean-François Cordeau, Manlio Gaudioso, Gilbert Laporte, Luigi Moccia:
The service allocation problem at the Gioia Tauro Maritime Terminal. Eur. J. Oper. Res. 176(2): 1167-1184 (2007) - [j149]Nicola Bianchessi, Jean-François Cordeau, Jacques Desrosiers, Gilbert Laporte, Vincent Raymond:
A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites. Eur. J. Oper. Res. 177(2): 750-762 (2007) - [j148]Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte:
Heuristic and lower bound for a stochastic location-routing problem. Eur. J. Oper. Res. 179(3): 940-955 (2007) - [j147]Irina Gribkovskaia Sr., Øyvind Halskau, Gilbert Laporte, Martin Vlcek:
General solutions to the single vehicle routing problem with pickups and deliveries. Eur. J. Oper. Res. 180(2): 568-584 (2007) - [j146]Edgar Alberto Cabral, Erhan Erkut, Gilbert Laporte, Raymond A. Patterson:
The network design problem with relays. Eur. J. Oper. Res. 180(2): 834-844 (2007) - [j145]Dag Haugland, Sin C. Ho, Gilbert Laporte:
Designing delivery districts for the vehicle routing problem with stochastic demands. Eur. J. Oper. Res. 180(3): 997-1010 (2007) - [j144]Julie Paquette, Jean-François Cordeau, Gilbert Laporte:
Étude comparative de divers modèles pour le problème de transport à la demande. INFOR Inf. Syst. Oper. Res. 45(2): 95-110 (2007) - [j143]Ghislain Dubuc, Jean-François Cordeau, Gilbert Laporte, Tolga Bektas:
Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique. INFOR Inf. Syst. Oper. Res. 45(3): 175-185 (2007) - [j142]Francesco Carrabs, Jean-François Cordeau, Gilbert Laporte:
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading. INFORMS J. Comput. 19(4): 618-632 (2007) - [j141]Éric Duchêne, Gilbert Laporte, Frédéric Semet:
The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms. Oper. Res. 55(5): 949-965 (2007) - [j140]Abdullah Dasci, Gilbert Laporte:
Erratum to "A Continuous Model for Multistore Competitive Location". Oper. Res. 55(6): 1188-1190 (2007) - [j139]Gilbert Babin, S. Deneault, Gilbert Laporte:
Improvements to the Or-opt heuristic for the symmetric travelling salesman problem. J. Oper. Res. Soc. 58(3): 402-407 (2007) - [j138]Irina Gribkovskaia Sr., Øyvind Halskau, Gilbert Laporte:
The bridges of Königsberg - A historical perspective. Networks 49(3): 199-203 (2007) - [j137]Stefan Ropke, Jean-François Cordeau, Gilbert Laporte:
Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49(4): 258-272 (2007) - [j136]Lars Magnus Hvattum, Arne Løkketangen, Gilbert Laporte:
A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems. Networks 49(4): 330-340 (2007) - [j135]Gilbert Laporte, Inmaculada Rodríguez Martín:
Locating a cycle in a transportation or a telecommunications network. Networks 50(1): 92-108 (2007) - [j134]Marcello Sammarra, Jean-François Cordeau, Gilbert Laporte, Maria Flavia Monaco:
A tabu search heuristic for the quay crane scheduling problem. J. Sched. 10(4-5): 327-336 (2007) - [j133]Claudia Archetti, Luca Bertazzi, Gilbert Laporte, Maria Grazia Speranza:
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem. Transp. Sci. 41(3): 382-391 (2007) - [p5]Jean-François Cordeau, Gilbert Laporte, Martin W. P. Savelsbergh, Daniele Vigo:
Chapter 6 Vehicle Routing. Transportation 2007: 367-428 - [p4]Jean-François Cordeau, Gilbert Laporte, Jean-Yves Potvin, Martin W. P. Savelsbergh:
Chapter 7 Transportation on Demand. Transportation 2007: 429-466 - [p3]Cynthia Barnhart, Gilbert Laporte:
Preface. Transportation 2007: v-vii - [e1]Cynthia Barnhart, Gilbert Laporte:
Transportation. Handbooks in Operations Research and Management Science 14, Elsevier 2007, ISBN 978-0-444-51346-5 [contents] - 2006
- [j132]Gilbert Laporte, Reza Zanjirani Farahani, Elnaz Miandoabchi:
Designing an efficient method for tandem AGV network design problem using tabu search. Appl. Math. Comput. 183(2): 1410-1421 (2006) - [j131]Jean-François Cordeau, Manlio Gaudioso, Gilbert Laporte, Luigi Moccia:
A Memetic Heuristic for the Generalized Quadratic Assignment Problem. INFORMS J. Comput. 18(4): 433-443 (2006) - [j130]Gianpaolo Ghiani, Gilbert Laporte, Frédéric Semet:
The Black and White Traveling Salesman Problem. Oper. Res. 54(2): 366-378 (2006) - [j129]Michel Gendreau, Gilbert Laporte, Frédéric Semet:
The maximal expected coverage relocation problem for emergency vehicles. J. Oper. Res. Soc. 57(1): 22-28 (2006) - [j128]J. Privé, Jacques Renaud, Fayez F. Boctor, Gilbert Laporte:
Solving a vehicle-routing problem arising in soft-drink distribution. J. Oper. Res. Soc. 57(9): 1045-1052 (2006) - [j127]Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello:
A Tabu Search Algorithm for a Routing and Container Loading Problem. Transp. Sci. 40(3): 342-350 (2006) - [j126]Lars Magnus Hvattum, Arne Løkketangen, Gilbert Laporte:
Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic. Transp. Sci. 40(4): 421-438 (2006) - 2005
- [j125]Horst A. Eiselt, Gilbert Laporte, Vedat Verter:
Foreword. Ann. Oper. Res. 136(1): 17-18 (2005) - [j124]Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega, Ignacio Sevillano:
Maximizing Trip Coverage in the Location of a Single Rapid Transit Alignment. Ann. Oper. Res. 136(1): 49-63 (2005) - [j123]Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González:
Locating median cycles in networks. Eur. J. Oper. Res. 160(2): 457-470 (2005) - [j122]Éric Duchêne, Gilbert Laporte, Frédéric Semet:
Branch-and-cut algorithms for the undirected m. Eur. J. Oper. Res. 162(3): 700-712 (2005) - [j121]Ardavan Asef-Vaziri, Gilbert Laporte:
Loop based facility planning and material handling. Eur. J. Oper. Res. 164(1): 1-11 (2005) - [j120]Abdullah Dasci, Gilbert Laporte:
A Continuous Model for Multistore Competitive Location. Oper. Res. 53(2): 263-280 (2005) - [j119]Abdullah Dasci, Gilbert Laporte:
An analytical approach to the facility location and capacity acquisition problem under demand uncertainty. J. Oper. Res. Soc. 56(4): 397-405 (2005) - [j118]Jean-François Cordeau, Gilbert Laporte:
Maximizing the value of an Earth observation satellite orbit. J. Oper. Res. Soc. 56(8): 962-968 (2005) - [j117]Patrizia Beraldi, Gianpaolo Ghiani, Gilbert Laporte, Roberto Musmanno:
Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem. Networks 45(4): 195-198 (2005) - [j116]Jean-François Cordeau, Gilbert Laporte, Pasquale Legato, Luigi Moccia:
Models and Tabu Search Heuristics for the Berth-Allocation Problem. Transp. Sci. 39(4): 526-538 (2005) - 2004
- [j115]Michel Gendreau, Gilbert Laporte, Frédéric Semet:
Heuristics and lower bounds for the bin packing problem with conflicts. Comput. Oper. Res. 31(3): 347-358 (2004) - [j114]Edgar Alberto Cabral, Michel Gendreau, Gianpaolo Ghiani, Gilbert Laporte:
Solving the hierarchical Chinese postman problem as a rural postman problem. Eur. J. Oper. Res. 155(1): 44-50 (2004) - [j113]Imdat Kara, Gilbert Laporte, Tolga Bektas:
A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem. Eur. J. Oper. Res. 158(3): 793-795 (2004) - [j112]Gianpaolo Ghiani, Francesca Guerriero, Gilbert Laporte, Roberto Musmanno:
Tabu Search Heuristics for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions. J. Math. Model. Algorithms 3(3): 209-223 (2004) - [j111]Jacques Renaud, Fayez F. Boctor, Gilbert Laporte:
Efficient heuristics for Median Cycle Problems. J. Oper. Res. Soc. 55(2): 179-186 (2004) - [j110]Jean-François Cordeau, Gilbert Laporte, Anne Mercier:
Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows. J. Oper. Res. Soc. 55(5): 542-546 (2004) - [j109]Gilbert Laporte, Gilles Pesant:
A general multi-shift scheduling system. J. Oper. Res. Soc. 55(11): 1208-1217 (2004) - [j108]Corinne Feremans, Martine Labbé, Gilbert Laporte:
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm. Networks 43(2): 71-86 (2004) - [j107]Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González:
The Ring Star Problem: Polyhedral analysis and exact algorithm. Networks 43(3): 177-189 (2004) - [j106]Gilbert Laporte:
Book review. Oper. Res. Lett. 32(4): 394-397 (2004) - [j105]Andrea Attanasio, Jean-François Cordeau, Gianpaolo Ghiani, Gilbert Laporte:
Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput. 30(3): 377-387 (2004) - [c4]Gilbert Laporte, Ángel Marín, Juan A. Mesa, Francisco A. Ortega:
An Integrated Methodology for the Rapid Transit Network Design Problem. ATMOS 2004: 187-199 - [r1]Richa Agarwal, Ravindra K. Ahuja, Gilbert Laporte, Zuo-Jun Max Shen:
A Composite Very-Large-Scale Neighborhood Search Algorithm for the Vehicle Routing Problem. Handbook of Scheduling 2004 - 2003
- [j104]Jean-François Cordeau, Gilbert Laporte:
The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms. 4OR 1(2): 89-101 (2003) - [j103]Mélanie Bourgeois, Gilbert Laporte, Frédéric Semet:
Heuristics for the black and white traveling salesman problem. Comput. Oper. Res. 30(1): 75-85 (2003) - [j102]Fayez F. Boctor, Gilbert Laporte, Jacques Renaud:
Heuristics for the traveling purchaser problem. Comput. Oper. Res. 30(4): 491-504 (2003) - [j101]Burçin Bozkaya, Erhan Erkut, Gilbert Laporte:
A tabu search heuristic and adaptive memory procedure for political districting. Eur. J. Oper. Res. 144(1): 12-26 (2003) - [j100]Luce Brotcorne, Gilbert Laporte, Frédéric Semet:
Ambulance location and relocation models. Eur. J. Oper. Res. 147(3): 451-463 (2003) - [j99]Corinne Feremans, Martine Labbé, Gilbert Laporte:
Generalized network design problems. Eur. J. Oper. Res. 148(1): 1-13 (2003) - [j98]Martine Labbé, Gilbert Laporte, Silvano Martello:
Upper bounds and algorithms for the maximum cardinality bin packing problem. Eur. J. Oper. Res. 149(3): 490-498 (2003) - [j97]Gianpaolo Ghiani, Francesca Guerriero, Gilbert Laporte, Roberto Musmanno:
Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. Eur. J. Oper. Res. 151(1): 1-11 (2003) - [j96]Gilbert Laporte, Jorge Riera-Ledesma, Juan José Salazar González:
A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem. Oper. Res. 51(6): 940-951 (2003) - [j95]M. Blais, Gilbert Laporte:
Exact solution of the generalized routing problem through graph transformations. J. Oper. Res. Soc. 54(8): 906-910 (2003) - [j94]M. Blais, Sophie D. Lapierre, Gilbert Laporte:
Solving a home-care districting problem in an urban setting. J. Oper. Res. Soc. 54(11): 1141-1147 (2003) - [j93]Gilbert Laporte, Roberto Musmanno:
Parallel computing in logistics. Parallel Comput. 29(5): 553-554 (2003) - [j92]Nicholas G. Hall, Gilbert Laporte, Esaignani Selvarajah, Chelliah Sriskandarajah:
Scheduling and Lot Streaming in Flowshops with No-Wait in Process. J. Sched. 6(4): 339-354 (2003) - 2002
- [j91]Abdullah Dasci, Horst A. Eiselt, Gilbert Laporte:
On the (r|Xp)-Medianoid Problem on a Network with Vertex and Edge Demands. Ann. Oper. Res. 111(1-4): 271-278 (2002) - [j90]Giuseppe Bruno, Michel Gendreau, Gilbert Laporte:
A heuristic for the location of a rapid transit line. Comput. Oper. Res. 29(1): 1-12 (2002) - [j89]Luce Brotcorne, Gilbert Laporte, Frédéric Semet:
Fast heuristics for large scale covering-location problems. Comput. Oper. Res. 29(6): 651-665 (2002) - [j88]Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega:
Locating stations on rapid transit lines. Comput. Oper. Res. 29(6): 741-759 (2002) - [j87]Jacques Renaud, Fayez F. Boctor, Gilbert Laporte:
Perturbation heuristics for the pickup and delivery traveling salesman problem. Comput. Oper. Res. 29(9): 1129-1141 (2002) - [j86]Jean-Marie Bourjolly, Gilbert Laporte, Gilles Pesant:
An exact algorithm for the maximum k-club problem in an undirected graph. Eur. J. Oper. Res. 138(1): 21-28 (2002) - [j85]Gilbert Laporte, François V. Louveaux, Luc van Hamme:
An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands. Oper. Res. 50(3): 415-423 (2002) - [j84]Jean-François Cordeau, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Frédéric Semet:
A guide to vehicle routing heuristics. J. Oper. Res. Soc. 53(5): 512-522 (2002) - [j83]Giuseppe Bruno, Gilbert Laporte:
A simple enhancement of the Esau-Williams heuristic for the capacitated minimum spanning tree problem. J. Oper. Res. Soc. 53(5): 583-586 (2002) - [j82]Gilbert Laporte, Udatta S. Palekar:
Some applications of the clustered travelling salesman problem. J. Oper. Res. Soc. 53(9): 972-976 (2002) - [j81]Corinne Feremans, Martine Labbé, Gilbert Laporte:
A comparative analysis of several formulations for the generalized minimum spanning tree problem. Networks 39(1): 29-34 (2002) - [p2]Gilbert Laporte, Frédéric Semet:
Classical Heuristics for the Capacitated VRP. The Vehicle Routing Problem 2002: 109-128 - [p1]Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin:
Metaheuristics for the Capacitated VRP. The Vehicle Routing Problem 2002: 129-154 - 2001
- [j80]Martine Labbé, Gilbert Laporte, Silvano Martello:
Preface. Discret. Appl. Math. 112(1-3): 1 (2001) - [j79]Michel Gendreau, Gilbert Laporte, Eduardo Morais Guimarães:
A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times. Eur. J. Oper. Res. 133(1): 183-189 (2001) - [j78]Corinne Feremans, Martine Labbé, Gilbert Laporte:
On generalized minimum spanning trees. Eur. J. Oper. Res. 134(2): 457-458 (2001) - [j77]Jacinthe Clossey, Gilbert Laporte, Patrick Soriano:
Solving arc routing problems with turn penalties. J. Oper. Res. Soc. 52(4): 433-439 (2001) - [j76]Jean-François Cordeau, Gilbert Laporte, Anne Mercier:
A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52(8): 928-936 (2001) - [j75]Gianpaolo Ghiani, Gennaro Improta, Gilbert Laporte:
The capacitated arc routing problem with intermediate facilities. Networks 37(3): 134-143 (2001) - [j74]Michel Gendreau, Gilbert Laporte, Frédéric Semet:
A dynamic model and parallel tabu search heuristic for real-time ambulance relocation. Parallel Comput. 27(12): 1641-1653 (2001) - 2000
- [j73]Mondher Hachicha, M. John Hodgson, Gilbert Laporte, Frédéric Semet:
Heuristics for the multi-vehicle covering tour problem. Comput. Oper. Res. 27(1): 29-42 (2000) - [j72]Jean-Marie Bourjolly, Gilbert Laporte, Gilles Pesant:
Heuristics for finding k-clubs in an undirected graph. Comput. Oper. Res. 27(6): 559-569 (2000) - [j71]Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega:
Optimization methods for the planning of rapid transit systems. Eur. J. Oper. Res. 122(1): 1-10 (2000) - [j70]Alain Hertz, Gilbert Laporte, Michel Mittaz:
A Tabu Search Heuristic for the Capacitated Arc Routing Problem. Oper. Res. 48(1): 129-135 (2000) - [j69]Éric Gourdin, Martine Labbé, Gilbert Laporte:
The Uncapacitated Facility Location Problem with Client Matching. Oper. Res. 48(5): 671-685 (2000) - [j68]Gianpaolo Ghiani, Gilbert Laporte:
A branch-and-cut algorithm for the Undirected Rural Postman Problem. Math. Program. 87(3): 467-481 (2000)
1990 – 1999
- 1999
- [j67]Michel Gendreau, Gilbert Laporte, Daniele Vigo:
Heuristics for the traveling salesman problem with pickup and delivery. Comput. Oper. Res. 26(7): 699-714 (1999) - [j66]Michel Gendreau, Gilbert Laporte, Christophe Musaraganyi, Éric D. Taillard:
A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 26(12): 1153-1173 (1999) - [j65]Corinne Feremans, Martine Labbé, Gilbert Laporte:
The Generalized Minimum Spanning Tree: Polyhedra and Branch-and-Cut. Electron. Notes Discret. Math. 3: 45-50 (1999) - [j64]Gilbert Laporte, Frédéric Semet:
An optimality cut for mixed integer linear programs. Eur. J. Oper. Res. 119(3): 671-677 (1999) - [j63]Alain Hertz, Gilbert Laporte, Pierrette Nanchen Hugo:
Improvement Procedures for the Undirected Rural Postman Problem. INFORMS J. Comput. 11(1): 53-62 (1999) - [j62]Andrés Weintraub, Julio Aboud, Claudio Fernández, Gilbert Laporte, Enrique Ramírez:
An emergency vehicle dispatching system for an electric utility in Chile. J. Oper. Res. Soc. 50(7): 690-696 (1999) - [j61]Gilbert Laporte:
The art and science of designing rotating schedules. J. Oper. Res. Soc. 50(10): 1011-1017 (1999) - [j60]Gianpaolo Ghiani, Gilbert Laporte:
Eulerian location problems. Networks 34(4): 291-302 (1999) - [j59]Shoshana Anily, Michel Gendreau, Gilbert Laporte:
The Swapping Problem on a Line. SIAM J. Comput. 29(1): 327-335 (1999) - 1998
- [j58]Martine Labbé, Gilbert Laporte, Patrick Soriano:
Covering a graph with cycles. Comput. Oper. Res. 25(6): 499-504 (1998) - [j57]Michel Gendreau, Gilbert Laporte, Frédéric Semet:
A tabu search heuristic for the undirected selective travelling salesman problem. Eur. J. Oper. Res. 106(2-3): 539-545 (1998) - [j56]Michel Gendreau, Alain Hertz, Gilbert Laporte, Mihnea Stan:
A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows. Oper. Res. 46(3): 330-335 (1998) - [j55]M. Banerjea-Brodeur, Jean-François Cordeau, Gilbert Laporte, A. Lasry:
Scheduling linen deliveries in a large hospital. J. Oper. Res. Soc. 49(8): 777-780 (1998) - [j54]Gilbert Laporte, Frédéric Semet, V. V. Dadeshidze, L. J. Olsson:
A tiling and routing heuristic for the screening of cytological samples. J. Oper. Res. Soc. 49(12): 1233-1238 (1998) - [j53]Michel Gendreau, Gilbert Laporte, Frédéric Semet:
A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks 32(4): 263-273 (1998) - 1997
- [j52]Bruce L. Golden, Gilbert Laporte, Éric D. Taillard:
An adaptive memory heuristic for a class of vehicle routing problems with minmax objective. Comput. Oper. Res. 24(5): 445-452 (1997) - [j51]Gilbert Laporte:
Modeling and solving several classes of arc routing problems as traveling salesman problems. Comput. Oper. Res. 24(11): 1057-1061 (1997) - [j50]Gilbert Laporte, Jean-Yves Potvin, Florence Quilleret:
A tabu search heuristic using genetic diversification for the clustered traveling salesman problem. J. Heuristics 2(3): 187-200 (1997) - [j49]Michel Gendreau, Gilbert Laporte, Frédéric Semet:
The Covering Tour Problem. Oper. Res. 45(4): 568-576 (1997) - [j48]Michel Gendreau, Gilbert Laporte, Alain Hertz:
An Approximation Algorithm for the Traveling Salesman Problem with Backhauls. Oper. Res. 45(4): 639-641 (1997) - [j47]Yazid M. Sharaiha, Michel Gendreau, Gilbert Laporte, Ibrahim H. Osman:
A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem. Networks 29(3): 161-171 (1997) - [j46]Jean-François Cordeau, Michel Gendreau, Gilbert Laporte:
A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2): 105-119 (1997) - [j45]Jean-Marie Bourjolly, Gilbert Laporte, Hélène Mercure:
A combinatorial column generation algorithm for the maximum stable set problem. Oper. Res. Lett. 20(1): 21-29 (1997) - [c3]Michael W. Carter, Gilbert Laporte:
Recent Developments in Practical Course Timetabling. PATAT 1997: 3-19 - 1996
- [j44]Gilbert Laporte, Ibrahim H. Osman:
Foreword. Ann. Oper. Res. 63(1): 1-2 (1996) - [j43]Ibrahim H. Osman, Gilbert Laporte:
Metaheuristics: A bibliography. Ann. Oper. Res. 63(5): 511-623 (1996) - [j42]Jacques Renaud, Gilbert Laporte, Fayez F. Boctor:
A tabu search heuristic for the multi-depot vehicle routing problem. Comput. Oper. Res. 23(3): 229-235 (1996) - [j41]Michel Gendreau, Alain Hertz, Gilbert Laporte:
The Traveling Salesman Problem with Backhauls. Comput. Oper. Res. 23(5): 501-508 (1996) - [j40]Jacques Renaud, Fayez F. Boctor, Gilbert Laporte:
A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem. INFORMS J. Comput. 8(2): 134-143 (1996) - [j39]Michel Gendreau, Gilbert Laporte, René Séguin:
A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers. Oper. Res. 44(3): 469-477 (1996) - [j38]Charles S. Revelle, Gilbert Laporte:
The Plant Location Problem: New Models and Research Prospects. Oper. Res. 44(6): 864-874 (1996) - [j37]Horst A. Eiselt, Michel Gendreau, Gilbert Laporte:
Optimal Location of Facilities on a Network with an Unreliable Node or Link. Inf. Process. Lett. 58(2): 71-74 (1996) - 1995
- [j36]Michel Gendreau, Gilbert Laporte:
Foreword. Ann. Oper. Res. 60(1) (1995) - [j35]Michel Gendreau, Gilbert Laporte:
Foreword. Ann. Oper. Res. 61(1) (1995) - [j34]Gilbert Laporte, Ibrahim H. Osman:
Routing problems: A bibliography. Ann. Oper. Res. 61(1): 227-262 (1995) - [j33]Horst A. Eiselt, Michel Gendreau, Gilbert Laporte:
Arc Routing Problems, Part I: The Chinese Postman Problem. Oper. Res. 43(2): 231-242 (1995) - [j32]Horst A. Eiselt, Michel Gendreau, Gilbert Laporte:
Arc Routing Problems, Part II: The Rural Postman Problem. Oper. Res. 43(3): 399-414 (1995) - [j31]Martine Labbé, Gilbert Laporte, Silvano Martello:
An exact algorithm for the dual bin packing problem. Oper. Res. Lett. 17(1): 9-18 (1995) - [j30]Michel Gendreau, Martine Labbé, Gilbert Laporte:
Efficient heuristics for the design of ring networks. Telecommun. Syst. 4(1): 177-188 (1995) - [j29]Michel Gendreau, Gilbert Laporte, Marius M. Solomon:
Single-Vehicle Routing and Scheduling to Minimize the Number of Delays. Transp. Sci. 29(1): 56-62 (1995) - [j28]Michel Gendreau, Gilbert Laporte, René Séguin:
An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers. Transp. Sci. 29(2): 143-155 (1995) - [j27]Paulo Morelato França, Michel Gendreau, Gilbert Laporte, Felipe Martins Müller:
The m-Traveling Salesman Problem with Minmax Objective. Transp. Sci. 29(3): 267-275 (1995) - [c2]Michael W. Carter, Gilbert Laporte:
Recent Developments in Practical Examination Timetabling. PATAT 1995: 3-21 - 1994
- [j26]Paulo Morelato França, Michel Gendreau, Gilbert Laporte, Felipe Martins Müller:
A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective. Comput. Oper. Res. 21(2): 205-210 (1994) - [j25]Moshe Dror, Gilbert Laporte, Pierre Trudeau:
Vehicle routing with split deliveries. Discret. Appl. Math. 50(3): 239-254 (1994) - [j24]Gilbert Laporte, François V. Louveaux, Hélène Mercure:
A Priori Optimization of the Probabilistic Traveling Salesman Problem. Oper. Res. 42(3): 543-549 (1994) - [j23]Gilbert Laporte, François V. Louveaux, Luc van Hamme:
Exact Solution to a Location Problem with Stochastic Demands. Transp. Sci. 28(2): 95-103 (1994) - 1993
- [j22]Véronique Lambert, Gilbert Laporte, François V. Louveaux:
Designing collection routes through bank branches. Comput. Oper. Res. 20(7): 783-791 (1993) - [j21]Matteo Fischetti, Gilbert Laporte, Silvano Martello:
The Delivery Man Problem and Cumulative Matroids. Oper. Res. 41(6): 1055-1064 (1993) - [j20]Moshe Dror, Gilbert Laporte, François V. Louveaux:
Vehicle routing with stochastic demands and restricted failures. ZOR Methods Model. Oper. Res. 37(3): 273-283 (1993) - [j19]Gilbert Laporte, François V. Louveaux:
The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13(3): 133-142 (1993) - [j18]Horst A. Eiselt, Gilbert Laporte:
The Existence of Equilibria in the 3-Facility Hotelling Model in a Tree. Transp. Sci. 27(1): 39-43 (1993) - [j17]Horst A. Eiselt, Gilbert Laporte, Jacques-François Thisse:
Competitive Location Models: A Framework and Bibliography. Transp. Sci. 27(1): 44-54 (1993) - [c1]Jean-Marie Bourjolly, Paul Gill, Gilbert Laporte, Hélène Mercure:
An exact quadratic 0-1 algorithm for the stable set problem. Cliques, Coloring, and Satisfiability 1993: 53-73 - 1992
- [j16]Michel Gendreau, Alain Hertz, Gilbert Laporte:
New Insertion and Postoptimization Procedures for the Traveling Salesman Problem. Oper. Res. 40(6): 1086-1094 (1992) - [j15]Horst A. Eiselt, Michel Gendreau, Gilbert Laporte:
Location of facilities on a network subject to a single-edge failure. Networks 22(3): 231-246 (1992) - [j14]Gilbert Laporte, François V. Louveaux, Hélène Mercure:
The Vehicle Routing Problem with Stochastic Travel Times. Transp. Sci. 26(3): 161-170 (1992) - [j13]Gilbert Laporte:
Selected Abstracts for the 1990-1991 Transportation Science Section Dissertation Prize Competition. Transp. Sci. 26(3): 252-260 (1992) - 1991
- [j12]Martine Labbé, Gilbert Laporte, Hélène Mercure:
Capacitated Vehicle Routing on Trees. Oper. Res. 39(4): 616-622 (1991) - [j11]Martin Desrochers, Gilbert Laporte:
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Oper. Res. Lett. 10(1): 27-36 (1991) - 1990
- [j10]Gilbert Laporte, Silvano Martello:
The selective travelling salesman problem. Discret. Appl. Math. 26(2-3): 193-207 (1990)
1980 – 1989
- 1989
- [j9]Moshe Dror, Gilbert Laporte, Pierre Trudeau:
Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks. Transp. Sci. 23(3): 166-176 (1989) - 1988
- [j8]Jacques Desrosiers, Gilbert Laporte, Michel Sauvé, François Soumis, Serge Taillefer:
Vehicle routing with full loads. Comput. Oper. Res. 15(3): 219-226 (1988) - [j7]Gilbert Laporte, Yves Nobert, Serge Taillefer:
Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems. Transp. Sci. 22(3): 161-172 (1988) - 1987
- [j6]Gilbert Laporte, Hélène Mercure, Yves Nobert:
Generalized travelling salesman problem through n sets of nodes: the asymmetrical case. Discret. Appl. Math. 18(2): 185-197 (1987) - 1986
- [j5]Gilbert Laporte, Sylvain Desroches:
The problem of assigning students to course sections in a large engineering school. Comput. Oper. Res. 13(4): 387-394 (1986) - [j4]Gilbert Laporte, Hélène Mercure, Yves Nobert:
An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks 16(1): 33-46 (1986) - 1985
- [j3]Gilbert Laporte, Yves Nobert, Martin Desrochers:
Optimal Routing under Capacity and Distance Restrictions. Oper. Res. 33(5): 1050-1073 (1985) - 1984
- [j2]Gilbert Laporte, Sylvain Desroches:
Examination timetabling by computer. Comput. Oper. Res. 11(4): 351-360 (1984) - [j1]Gilbert Laporte, Martin Desrochers, Yves Nobert:
Two exact algorithms for the distance-constrained vehicle routing problem. Networks 14(1): 161-172 (1984)
1970 – 1979
- 1975
- [b1]Gilbert Laporte:
Permutation Programming: Problems, Methods and Applications. London School of Economics, UK, 1975
Coauthor Index
[j318] [j309] [j297] [j291] [j288] [j272] [j268] [j260] [j259] [j253] [j252] [j249] [j244] [j237] [j235] [j232] [j231] [j230] [j223] [j222] [j221] [j219] [j218] [j216] [j213] [j212] [j211] [j210] [j208] [j197] [j195] [j193] [j190] [j186] [j182] [j179] [j177] [j172] [j171] [j169] [j168] [j156] [j153] [j151] [j150] [j149] [j144] [j143] [j142] [j137] [j134] [p5] [p4] [j131] [j118] [j116] [j110] [j105] [j104] [j84] [j76] [j55] [j46]
Irina Gribkovskaia Sr.
aka: Irina V. Gribkovskaia
aka: Irina V. Gribkovskaia
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
