The following pages link to G. Laporte (Q203167):
Displaying 50 items.
- The single vehicle routing problem with deliveries and selective pickups (Q2475847) (← links)
- The dial-a-ride problem: Models and algorithms (Q2480256) (← links)
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (Q2482819) (← links)
- Classification, models and exact algorithms for multi-compartment delivery problems (Q2630232) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- A review of vehicle routing with simultaneous pickup and delivery (Q2664320) (← links)
- The commodity-split multi-compartment capacitated arc routing problem (Q2664322) (← links)
- A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations (Q2664431) (← links)
- A scalable dynamic parking allocation framework (Q2664436) (← links)
- A dynamic multi-period general routing problem arising in postal service and parcel delivery systems (Q2668612) (← links)
- Solving real-size stochastic railway rapid transit network construction scheduling problems (Q2669704) (← links)
- Minimum cost delivery of multi-item orders in e-commerce logistics (Q2669718) (← links)
- Optimizing access to drinking water in remote areas. Application to Nepal (Q2669783) (← links)
- Pallet location and job scheduling in a twin-robot system (Q2676351) (← links)
- A column generation-based heuristic for a rehabilitation patient scheduling and routing problem (Q2676370) (← links)
- Analysis of the selective traveling salesman problem with time-dependent profits (Q2701177) (← links)
- The capacitated arc routing problem with intermediate facilities (Q2719845) (← links)
- A generalized insertion heuristic for the travelling salesman problem with time windows (Q2781094) (← links)
- A comparative analysis of several formulations for the generalized minimum spanning tree problem (Q2782729) (← links)
- Analysis of an exact algorithm for the vessel speed optimization problem (Q2811302) (← links)
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem (Q2815449) (← links)
- A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem (Q2815467) (← links)
- A memetic heuristic for the generalized quadratic assignment problem (Q2892300) (← links)
- Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading (Q2892373) (← links)
- Benders decomposition for large-scale uncapacitated hub location (Q2893920) (← links)
- The integrated production and transportation scheduling problem for a product with a short lifespan (Q2900989) (← links)
- Scenario tree-based heuristics for stochastic inventory-routing problems (Q2901065) (← links)
- A branch-and-cut algorithm for the preemptive swapping problem (Q2913951) (← links)
- Districting for Arc Routing (Q2940070) (← links)
- Combinatorial Optimization Problems with Soft and Hard Requirements (Q3030582) (← links)
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks (Q3032042) (← links)
- Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach (Q3037137) (← links)
- (Q3040949) (← links)
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading (Q3057131) (← links)
- Modeling and solving a multimodal transportation problem with flexible-time and scheduled services (Q3076017) (← links)
- The preemptive swapping problem on a tree (Q3100688) (← links)
- The art and science of designing rotating schedules (Q3154410) (← links)
- Scheduling linen deliveries in a large hospital (Q3157736) (← links)
- A tiling and routing heuristic for the screening of cytological samples (Q3157800) (← links)
- Solving a vehicle-routing problem arising in soft-drink distribution (Q3182656) (← links)
- (Q3197595) (← links)
- (Q3217886) (← links)
- (Q3317135) (← links)
- Two exact algorithms for the distance-constrained vehicle routing problem (Q3325496) (← links)
- Locational equilibrium of two facilities on a tree (Q3362083) (← links)
- The maximal expected coverage relocation problem for emergency vehicles (Q3369247) (← links)
- The Black and White Traveling Salesman Problem (Q3391982) (← links)
- The Undirected <i>m</i>-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms (Q3392127) (← links)
- Erratum to “A Continuous Model for Multistore Competitive Location” (Q3392148) (← links)
- A tabu search heuristic for a routing problem arising in servicing of offshore oil and gas platforms (Q3394014) (← links)
