The following pages link to Norbert Ascheuer (Q202054):
Displaying 9 items.
- Order picking in an automatic warehouse: Solving online asymmetric TSPs (Q1304425) (← links)
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints (Q1588841) (← links)
- (Q2728857) (← links)
- (Q4353136) (← links)
- (Q4494399) (← links)
- A polyhedral study of the asymmetric traveling salesman problem with time windows (Q4519128) (← links)
- A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing) (Q4697307) (← links)
- (Q4875843) (← links)
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut (Q5943078) (← links)
