The following pages link to G. Laporte (Q203167):
Displaying 50 items.
- Eulerian location problems (Q4934874) (← links)
- (Q4955270) (← links)
- (Q4955272) (← links)
- (Q4999375) (← links)
- Single Allocation Hub Location with Heterogeneous Economies of Scale (Q5080641) (← links)
- Exact Solution of the Evasive Flow Capturing Problem (Q5131542) (← links)
- Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location (Q5131704) (← links)
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
- Optimal tour planning with specified nodes (Q5184697) (← links)
- (Q5184698) (← links)
- A branch‐and‐cut algorithm for the nonpreemptive swapping problem (Q5187945) (← links)
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136) (← links)
- Simultaneous frequency and capacity setting for rapid transit systems with a competing mode and capacity constraints (Q5240130) (← links)
- Arc Routing (Q5256774) (← links)
- (Q5271448) (← links)
- (Q5271450) (← links)
- (Q5271452) (← links)
- A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem (Q5284221) (← links)
- The Existence of Equilibria in the 3-Facility Hotelling Model in a Tree (Q5285889) (← links)
- Competitive Location Models: A Framework and Bibliography (Q5285890) (← links)
- Expected Distances between Two Uniformly Distributed Random Points in Rectangles and Rectangular Parallelpipeds (Q5289666) (← links)
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows (Q5295484) (← links)
- A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems (Q5295489) (← links)
- An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand (Q5301129) (← links)
- Maximizing the value of an Earth observation satellite orbit (Q5313402) (← links)
- A Continuous Model for Multistore Competitive Location (Q5322088) (← links)
- The orienteering problem with variable profits (Q5326782) (← links)
- An exact algorithm for the petrol station replenishment problem (Q5387398) (← links)
- A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers (Q5387416) (← links)
- Improvements to the Or-opt heuristic for the symmetric travelling salesman problem (Q5428949) (← links)
- (Q5431823) (← links)
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints (Q5433189) (← links)
- Erratum: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints (Q5449670) (← links)
- Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem (Q5463668) (← links)
- (Q5494216) (← links)
- (Q5687249) (← links)
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers (Q5689143) (← links)
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers (Q5689794) (← links)
- (Q5692628) (← links)
- Application of the Double Standard Model for Ambulance Location (Q5850939) (← links)
- Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015 (Q5879644) (← links)
- Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem (Q5888090) (← links)
- A Tabu Search Algorithm For The Site Dependent Vehicle Routing Problem With Time Windows (Q5888212) (← links)
- An Interactive Decision Support System For The Design Of Rapid Public Transit Networks (Q5888242) (← links)
- Periodic supply vessel planning under demand and weather uncertainty (Q5889188) (← links)
- A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times (Q5943566) (← links)
- On generalized minimum spanning trees (Q5945860) (← links)
- A heuristic for the location of a rapid transit line (Q5955468) (← links)
- A dynamic model and parallel tabu search heuristic for real-time ambulance relocation (Q5958153) (← links)
- Fast heuristics for large scale covering-location problems (Q5959388) (← links)
