The following pages link to Gilbert Laporte (Q203167):
Displayed 50 items.
- A large neighbourhood search heuristic for ship routing and scheduling with split loads (Q709186) (← links)
- A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants (Q716345) (← links)
- Heuristics for the mixed swapping problem (Q733528) (← links)
- A continuous analysis framework for the solution of location-allocation problems with dense demand (Q733530) (← links)
- Maximizing trip coverage in the location of a single rapid transit alignment (Q816407) (← links)
- A tabu search heuristic for the quay crane scheduling problem (Q835567) (← links)
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← links)
- Exact and heuristic procedures for the material handling circular flow path design problem (Q852933) (← links)
- The multi-depot vehicle routing problem with inter-depot routes (Q852937) (← links)
- The service allocation problem at the Gioia Tauro maritime terminal (Q852990) (← links)
- A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites (Q856269) (← links)
- Heuristic and lower bound for a stochastic location-routing problem (Q864014) (← links)
- Designing an efficient method for tandem AGV network design problem using tabu search (Q865602) (← links)
- General solutions to the single vehicle routing problem with pickups and deliveries (Q869591) (← links)
- The network design problem with relays (Q869627) (← links)
- Designing delivery districts for the vehicle routing problem with stochastic demands (Q872114) (← links)
- Shared mobility systems (Q904286) (← links)
- The selective travelling salesman problem (Q910347) (← links)
- Integer programming formulations for the multi-depot vehicle routing problem: Comments on a paper by Kulkarni and Bhave (Q922344) (← links)
- Exact algorithms for the joint object placement and request routing problem in content distribution networks (Q925830) (← links)
- Iterated tabu search for the car sequencing problem (Q932213) (← links)
- A heuristic for the multi-period petrol station replenishment problem (Q933502) (← links)
- A tabu search heuristic for the generalized minimum spanning tree problem (Q933503) (← links)
- The capacity and distance constrained plant location problem (Q954059) (← links)
- The petrol station replenishment problem with time windows (Q955625) (← links)
- Partial integration of frequency allocation within antenna positioning in GSM mobile networks (Q958101) (← links)
- Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions (Q964850) (← links)
- A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows (Q976316) (← links)
- An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions (Q992574) (← links)
- The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960) (← links)
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries (Q1011218) (← links)
- Dynamic pickup and delivery problems (Q1038370) (← links)
- A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars (Q1038386) (← links)
- The attractive traveling salesman problem (Q1043335) (← links)
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case (Q1096550) (← links)
- Vehicle routing with full loads (Q1099072) (← links)
- Optimal sizes of facilities on a linear market (Q1110447) (← links)
- Competitive spatial models (Q1113783) (← links)
- Models and exact solutions for a class of stochastic location-routing problems (Q1123112) (← links)
- Rotating schedules (Q1131943) (← links)
- An exact algorithm for minimizing routing and operating costs in depot location (Q1148218) (← links)
- Hamiltonian location problems (Q1173005) (← links)
- The use of domains in multicriteria decision making (Q1194715) (← links)
- Branch-and-bound algorithms for the multi-product assembly line balancing problem (Q1194733) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- Dynamic programming algorithm for a FMS scheduling problem (Q1197593) (← links)
- The vehicle routing problem: An overview of exact and approximate algorithms (Q1198313) (← links)
- The seriation problem and the travelling salesman problem (Q1252153) (← links)
- Stochastic vehicle routing (Q1266554) (← links)
- Sequential location problems (Q1278482) (← links)