Gilbert Laporte
Industrial and Manufacturing Engineering · 2000–2020
A researcher in the Science corpus: 34 papers; trusts 51 researchers and is trusted by 98 researchers here, as inferred from the citation graph.
Subfields
- Industrial and Manufacturing Engineering — 148 citations into it; #7 of 2,525 by trust here, #29 by citations
- Automotive Engineering — 82 citations into it; #18 of 3,094 by trust here, #317 by citations
- Building and Construction — 40 citations into it; #290 of 2,914 by trust here, #405 by citations
- Computer Vision and Pattern Recognition — 27 citations into it; #4,994 of 21,973 by trust here, #7,900 by citations
- Transportation — 22 citations into it; #830 of 2,080 by trust here, #380 by citations
- Artificial Intelligence — 21 citations into it; #21,910 of 36,961 by trust here, #23,800 by citations
- Management Science and Operations Research — 20 citations into it
- Computational Theory and Mathematics — 9 citations into it
Whom Gilbert Laporte trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Jean-François Cordeau
- Paolo Toth
- Stefan Røpke
- David Pisinger
- Roberto Baldacci
- Michel Gendreau
- Daniele Vigo
- John H. Holland
- David L. Applegate
- Marc Reimann
Who trusts Gilbert Laporte overall
- Jean-François Cordeau
- Michel Gendreau
- Thibaut Vidal
- Rahma Lahyani
- Teodor Gabriel Crainic
- Qi Zhang
- Olli Bräysy
- Michael Schneider
- Dominik Goeke
- Christian Prins
Papers from Gilbert Laporte's perspective
Ordered by how strongly the researchers Gilbert Laporte trusts endorse each paper. Same corpus, a different order for every researcher.
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem (INFORMS journal on computing)
- Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem (Mathematical programming)
- A unified heuristic for a large class of Vehicle Routing Problems with Backhauls (European Journal of Operational Research)
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A dynamic model and parallel tabu search heuristic for real-time ambulance relocation (Parallel Computing)
- Solving the pickup and delivery problem with time windows using reactive tabu search
- On the shortest spanning subtree of a graph and the traveling salesman problem
- A metaheuristic for the pickup and delivery problem with time windows (Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001)
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows (Computers & Operations Research)
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
Their papers
- Drone-aided routing: A literature review (2020) — 432 citations
- A concise guide to existing and emerging vehicle routing problem variants (2019) — 296 citations
- Continuous approximation models in freight distribution management (2017) — 65 citations
- Arc Routing: Problems, Methods, and Applications (2015) — 142 citations
- Thirty Years of Inventory Routing (2014) — 636 citations
- A review of recent research on green road freight transportation (2014) — 773 citations
- Improved solutions for inventory-routing problems through valid inequalities and input ordering (2014) — 153 citations
- The bi-objective Pollution-Routing Problem (2014) — 448 citations
- An adaptive large neighborhood search heuristic for the Pollution-Routing Problem (2012) — 715 citations
- Reducing fuel emissions by optimizing speed on shipping routes (2010) — 394 citations
- Dynamic pickup and delivery problems (2010) — 753 citations
- Stochastic Vehicle Routing Problems (2009) — 48 citations
- Fifty Years of Vehicle Routing (2009) — 1,082 citations
- Horizontal cooperation among freight carriers: request allocation and profit sharing (2008) — 361 citations
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows (2007) — 308 citations
- Static pickup and delivery problems: a classification scheme and survey (2007) — 791 citations
- What you should know about the vehicle routing problem (2007) — 355 citations
- A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem (2007) — 454 citations
- The multi-depot vehicle routing problem with inter-depot routes (2007) — 342 citations
- The dial-a-ride problem: models and algorithms (2006) — 956 citations