The following pages link to Olivier Péton (Q325467):
Displaying 13 items.
- Location of distribution centers in a multi-period collaborative distribution network (Q325468) (← links)
- The dial-A-ride problem with transfers (Q336745) (← links)
- A large neighborhood search heuristic for supply chain network design (Q1652183) (← links)
- Multiple cuts with a homogeneous analytic center cutting plane method (Q1868387) (← 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)
- Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers (Q2450604) (← links)
- A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes (Q2514736) (← links)
- Homogeneous analytic center cutting plane methods with approximate centers (Q4504783) (← 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)
- Solving the large-scale min-max \(k\)-rural postman problem for snow plowing (Q6496352) (← links)
