The following pages link to Jean-François Cordeau (Q297220):
Displayed 50 items.
- Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem (Q297221) (← links)
- Exact and heuristic algorithms for the design of hub networks with multiple lines (Q319742) (← links)
- Heuristics for dynamic and stochastic inventory-routing (Q337178) (← links)
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
- Simulation-based optimization for housekeeping in a container transshipment terminal (Q337263) (← links)
- The production routing problem: a review of formulations and solution algorithms (Q337418) (← links)
- A decomposition-based heuristic for the multiple-product inventory-routing problem (Q337420) (← links)
- Tactical network planning for food aid distribution in Kenya (Q337453) (← links)
- Heuristics for dynamic and stochastic routing in industrial shipping (Q339576) (← links)
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics (Q339671) (← links)
- A branch-price-and-cut method for a ship routing and scheduling problem with split loads (Q339703) (← links)
- A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem (Q342108) (← links)
- Solving a dynamic facility location problem with partial closing and reopening (Q342268) (← 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)
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (Q443822) (← links)
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays (Q540153) (← links)
- Using Benders decomposition to implicitly model tour scheduling (Q596429) (← links)
- A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem (Q602676) (← links)
- Benders, metric and cutset inequalities for multicommodity capacitated network design (Q632387) (← links)
- Scheduling technicians and tasks in a telecommunications company (Q707696) (← links)
- Modeling and solving a logging camp location problem (Q748565) (← links)
- A tabu search heuristic for the quay crane scheduling problem (Q835567) (← links)
- A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine (Q835634) (← links)
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← 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)
- An integrated model for logistics network design (Q867539) (← 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 tabu search heuristic for the generalized minimum spanning tree problem (Q933503) (← links)
- Implicit shift scheduling with multiple breaks and work stretch duration restrictions (Q969752) (← links)
- The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960) (← links)
- A column generation heuristic for a dynamic generalized assignment problem (Q1010279) (← links)
- Dynamic pickup and delivery problems (Q1038370) (← links)
- The attractive traveling salesman problem (Q1043335) (← links)
- Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716) (← links)
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms (Q1432014) (← links)
- A decomposition heuristic for a rich production routing problem (Q1651659) (← links)
- Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows (Q1652285) (← links)
- Benders decomposition for very large scale partial set covering and maximal covering location problems (Q1719620) (← links)
- Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds (Q1751896) (← links)
- Scheduling identical parallel machines with tooling constraints (Q1752870) (← links)
- The inventory-routing problem with transshipment (Q1761192) (← links)
- A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem (Q1764761) (← links)
- A computational comparison of flow formulations for the capacitated location-routing problem (Q1799384) (← links)
- Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← links)
- Solving the wire-harness design problem at a European car manufacturer (Q1991185) (← links)