The following pages link to G. Laporte (Q203167):
Displaying 50 items.
- Wide area telecommunication network design: application to the Alberta SuperNet (Q3394015) (← links)
- Horizontal cooperation among freight carriers: request allocation and profit sharing (Q3394017) (← links)
- A two-level simulated annealing algorithm for efficient dissemination of electronic content (Q3394025) (← links)
- Locational analysis: highlights of growth to maturity (Q3394058) (← links)
- A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal (Q3423263) (← links)
- The bridges of Königsberg—A historical perspective (Q3442862) (← links)
- (Q3470245) (← links)
- What you should know about the vehicle routing problem (Q3499286) (← links)
- The maximum return-on-investment plant location problem with market share (Q3515506) (← links)
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) (← links)
- One-to-Many-to-One Single Vehicle Pickup and Delivery Problems (Q3564364) (← links)
- A concise guide to the Traveling Salesman Problem (Q3582631) (← links)
- Some applications of the generalized vehicle routing problem (Q3585715) (← links)
- Locating a cycle in a transportation or a telecommunications network (Q3593375) (← links)
- Heuristiques pour le Problème du Vendeur<i>m</i>-Péripatétique (Q3621973) (← links)
- An Integer <i>L</i>-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands (Q3635101) (← links)
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem (Q3637400) (← links)
- Optimal Routing under Capacity and Distance Restrictions (Q3694981) (← links)
- Generalized Subtour Elimination Constraints and Connectivity Constraints (Q3725874) (← links)
- (Q3751354) (← links)
- Solving a family of permutation problems on 0-1 matrices (Q3753804) (← links)
- (Q3762096) (← links)
- (Q3770307) (← links)
- A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem (Q3773682) (← links)
- Trading areas of facilities with different sizes (Q3778509) (← links)
- An exact algorithm for the asymmetrical capacitated vehicle routing problem (Q3786261) (← links)
- (Q3787762) (← links)
- (Q3802874) (← links)
- (Q3807864) (← links)
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems (Q3813590) (← links)
- Dynamic Location-routeing Problems (Q3818095) (← links)
- A Cutting Planes Algorithm for the m-Salesmen Problem (Q3883900) (← links)
- (Q3912390) (← links)
- Capacitated Vehicle Routing on Trees (Q3980515) (← links)
- Location of facilities on a network subject to a single‐edge failure (Q3993631) (← links)
- A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems (Q4018534) (← links)
- The Vehicle Routing Problem with Stochastic Travel Times (Q4021778) (← links)
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem (Q4032587) (← links)
- A Dynamic Programming Formulation with Diverse Applications (Q4082577) (← links)
- A Practical Optimisation Technique for a Queueing System (Q4114940) (← links)
- Vehicle routing with stochastic demands and restricted failures (Q4201811) (← links)
- Locating a transit line using tabu search (Q4228745) (← links)
- Solving an ambulance location model by tabu search (Q4228774) (← links)
- Maximizing pedestrian flow in shopping center layout (Q4229612) (← links)
- (Q4229634) (← links)
- Two exact algorithms for the vehicle routing problem on trees (Q4238575) (← links)
- (Q4254942) (← links)
- The Swapping Problem on a Line (Q4268883) (← links)
- The Delivery Man Problem and Cumulative Matroids (Q4285163) (← links)
- (Q4296537) (← links)
