The following pages link to Gilbert Laporte (Q203167):
Displayed 50 items.
- Transferability of collective transportation line networks from a topological and passenger demand perspective (Q258446) (← links)
- A review of recent research on green road freight transportation (Q296573) (← links)
- The static bicycle relocation problem with demand intervals (Q296779) (← links)
- Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem (Q297221) (← links)
- Multi-level facility location as the maximization of a submodular set function (Q320143) (← links)
- The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm (Q320620) (← links)
- The traveling salesman problem with time-dependent service times (Q320683) (← links)
- Thirty years of heterogeneous vehicle routing (Q320861) (← links)
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560) (← links)
- An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem (Q322976) (← links)
- Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem (Q323162) (← links)
- Large neighborhood search for multi-trip vehicle routing (Q323545) (← links)
- The synchronized arc and node routing problem: application to road marking (Q336355) (← links)
- Rapid transit network design for optimal cost and origin-destination demand capture (Q336685) (← links)
- The multi-district team orienteering problem (Q336760) (← links)
- Optimal joint replenishment, delivery and inventory management policies for perishable products (Q337009) (← links)
- The dynamic multiperiod vehicle routing problem with probabilistic information (Q337038) (← links)
- Heuristics for dynamic and stochastic inventory-routing (Q337178) (← links)
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows (Q337225) (← links)
- Model-based automatic neighborhood design by unsupervised learning (Q337347) (← links)
- Tactical network planning for food aid distribution in Kenya (Q337453) (← links)
- Dynamic design of sales territories (Q337456) (← links)
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading (Q337617) (← links)
- Path based algorithms for metro network design (Q337631) (← links)
- The exact solution of several classes of inventory-routing problems (Q340258) (← links)
- A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows (Q342060) (← links)
- A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem (Q342108) (← links)
- Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm (Q342250) (← links)
- A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand (Q342327) (← links)
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands (Q406333) (← links)
- Stochastic uncapacitated hub location (Q421562) (← links)
- Optimizing yard assignment in an automotive transshipment terminal (Q421631) (← links)
- The delivery man problem with time windows (Q429673) (← links)
- A general rapid network design, line planning and fleet investment integrated model (Q512985) (← links)
- A short-turning policy for the management of demand disruptions in rapid transit systems (Q512986) (← links)
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays (Q540153) (← links)
- The capacitated vehicle routing problem with stochastic demands and time windows (Q547129) (← links)
- Item:Q203167 (redirect page) (← links)
- A branch and bound algorithm for the capacitated vehicle routing problem (Q585095) (← links)
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem (Q596294) (← links)
- A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem (Q602676) (← links)
- Comments on: Routing problems with loading constraints (Q610993) (← links)
- A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem (Q632643) (← links)
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse (Q688927) (← links)
- Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions (Q702760) (← links)
- Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (Q704117) (← links)
- Loop based facility planning and material handling (Q707078) (← links)
- Scheduling technicians and tasks in a telecommunications company (Q707696) (← links)
- Minimum cost path problems with relays (Q709122) (← links)
- A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand (Q709182) (← links)