1. Ascheuer N., Jünger M., Reinelt G.: A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints. Comput. Optim. Appl. 17, 61–84 (2000)
2. Balas E., Fischetti M., Pulleyblank W.R.: The precedence-constrained asymmetric traveling salesman polytope. Math. Program. 68, 241–265 (1995)
3. Christof, T., Löbel, A.: Porta—a polyhedron representation and transformation algorithm. http://www.iwr.uni-heidelberg.de/groups/comopt/software/PORTA/index.html . ZIB, Konrad-Zuse-Zentrum für Informationstechnik Berlin.
4. Cordeau J.-F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54, 573–586 (2006)
5. Cordeau, J.-F., Laporte, G., Ropke, S.: Recent models and algorithms for one-to-one pickup and delivery problems. In: Golden, B.L., Raghavan, S., Wasil, E.A. (eds.) The Vehicle Routing Problem, Latest Advances and Challenges. Springer, Boston (2008) (forthcoming)