The following pages link to Simon Spoorendonk (Q439551):
Displayed 9 items.
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times (Q439552) (← links)
- A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
- Simultaneously exploiting two formulations: an exact Benders decomposition approach (Q2664373) (← links)
- Cutting planes for branch-and-price algorithms (Q3113514) (← links)
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows (Q3392186) (← links)
- Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows (Q3564367) (← links)
- Optimization of the drayage problem using exact methods (Q5879640) (← links)
- Liner Shipping Cargo Allocation with Repositioning of Empty Containers (Q6102725) (← links)
- Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows (Q6160235) (← links)