The following pages link to Fabien Lehuédé (Q323287):
Displayed 15 items.
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization (Q323288) (← links)
- Location of distribution centers in a multi-period collaborative distribution network (Q325468) (← links)
- The dial-A-ride problem with transfers (Q336745) (← links)
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization (Q1651513) (← links)
- A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking (Q1652321) (← links)
- A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows (Q2083929) (← links)
- A lexicographic minimax approach to the vehicle routing problem with route balancing (Q2282498) (← links)
- MCS---a new algorithm for multicriteria optimisation in constraint programming (Q2379869) (← links)
- Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers (Q2450604) (← links)
- Integration and propagation of a multi-criteria decision making model in constraint programming (Q2506237) (← links)
- A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes (Q2514736) (← links)
- A Lower Bound of the Choquet Integral Integrated Within Martins’ Algorithm (Q3112556) (← links)
- The time‐consistent dial‐a‐ride problem (Q6065902) (← links)
- Small and large neighborhood search for the park-and-loop routing problem with parking selection (Q6112711) (← links)
- A continuous‐time service network design and vehicle routing problem (Q6196874) (← links)