The following pages link to G. Laporte (Q203167):
Displaying 50 items.
- Exact Solution to a Location Problem with Stochastic Demands (Q4302926) (← links)
- A Priori Optimization of the Probabilistic Traveling Salesman Problem (Q4305756) (← links)
- Some Applications of the Generalized Travelling Salesman Problem (Q4344427) (← links)
- Optimal sequencing of skip collections and deliveries (Q4345519) (← links)
- The Plant Location Problem: New Models and Research Prospects (Q4346338) (← links)
- A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem (Q4347283) (← links)
- Solving An Integrated Logistics Problem Arising In Grocery Distribution (Q4356606) (← links)
- A tabu search heuristic for periodic and multi-depot vehicle routing problems (Q4361181) (← links)
- The Covering Tour Problem (Q4363758) (← links)
- An Approximation Algorithm for the Traveling Salesman Problem with Backhauls (Q4363764) (← links)
- (Q4365134) (← links)
- (Q4383638) (← links)
- (Q4398371) (← links)
- Improvement Procedures for the Undirected Rural Postman Problem (Q4427362) (← links)
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm (Q4458720) (← links)
- The Ring Star Problem: Polyhedral analysis and exact algorithm (Q4474293) (← links)
- Heuristics for the location of inspection stations on a network (Q4488781) (← links)
- (Q4522097) (← links)
- A Tabu Search Heuristic for the Capacitated arc Routing Problem (Q4530642) (← links)
- The Uncapacitated Facility Location Problem with Client Matching (Q4530658) (← links)
- (Q4532227) (← links)
- (Q4532228) (← links)
- A branch-and-cut algorithm for the undirected selective traveling salesman problem (Q4540081) (← links)
- Scheduling twin robots on a line (Q4632823) (← links)
- The Rainbow Cycle Cover Problem (Q4642402) (← links)
- A comparison of several models for the hamiltonian <i>p</i>‐median problem (Q4642484) (← links)
- A guide to vehicle routing heuristics (Q4656651) (← links)
- A simple enhancement of the Esau–Williams heuristic for the capacitated minimum spanning tree problem (Q4656658) (← links)
- Some applications of the clustered travelling salesman problem (Q4656710) (← links)
- Solving arc routing problems with turn penalties (Q4658427) (← links)
- A unified tabu search heuristic for vehicle routing problems with time windows (Q4658480) (← links)
- Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows (Q4661048) (← links)
- Efficient heuristics for Median Cycle Problems (Q4661131) (← links)
- (Q4668751) (← links)
- Models and algorithms for the dynamic-demand joint replenishment problem (Q4671273) (← links)
- A new heuristic for the multi-mode resource investment problem (Q4679785) (← links)
- Scheduling and lot streaming in two-machine open shops with no-wait in process (Q4680466) (← links)
- A practical exact algorithm for the shortest loop design problem in a block layout (Q4681149) (← links)
- A general multi-shift scheduling system (Q4681719) (← links)
- Vehicle Routeing with Multiple Use of Vehicles (Q4717157) (← links)
- (Q4762462) (← links)
- A Tabu Search Heuristic for the Vehicle Routing Problem (Q4834331) (← links)
- Single-Vehicle Routing and Scheduling to Minimize the Number of Delays (Q4836842) (← links)
- Optimal tool partitioning rules for numerically controlled punch press operations (Q4846484) (← links)
- Arc Routing Problems, Part I: The Chinese Postman Problem (Q4849324) (← links)
- Arc Routing Problems, Part II: The Rural Postman Problem (Q4861354) (← links)
- An Improved Petal Heuristic for the Vehicle Routeing Problem (Q4887791) (← links)
- The <i>m</i>-Traveling Salesman Problem with Minmax Objective (Q4897090) (← links)
- Accelerating benders decomposition with heuristicmaster problem solutions (Q4904321) (← links)
- Reducing fuel emissions by optimizing speed on shipping routes (Q4933622) (← links)
