On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem. - Norbert Ascheuer; Laureano F. Escudero; Martin Grötschel; Mechthild Stoer (IPCO, 1990)

A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing). - Norbert Ascheuer; Laureano F. Escudero; Martin Grötschel; Mechthild Stoer (SIAM J. Optim., 1993)

Order picking in an automatic warehouse: Solving online asymmetric TSPs. - Norbert Ascheuer; Martin Grötschel; Atef Abdel-Aziz Abdel-Hamid (Math. Methods Oper. Res., 1999)

Online Dial-a-Ride Problems: Minimizing the Completion Time. - Norbert Ascheuer; Sven Oliver Krumke; Jörg Rambau (STACS, 2000)

A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints. - Norbert Ascheuer; Michael Jünger; Gerhard Reinelt (Comput. Optim. Appl., 2000)

A polyhedral study of the asymmetric traveling salesman problem with time windows. - Norbert Ascheuer; Matteo Fischetti; Martin Grötschel (Networks, 2000)

Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut. - Norbert Ascheuer; Matteo Fischetti; Martin Grötschel (Math. Program., 2001)

A nation-wide optimization study on the consolidation of local exchanges using long-reach passive optical networks. - Roland Wessäly; Christian Raack; Norbert Ascheuer (ICTON, 2014)