1. Applegate D, Bixby R, Chvátal V, Cook W (1995) Finding cuts in the TSP (a preliminary report). Technical report, Center for Discrete Mathematics and Theoretical Computer Science (DIMACS). DIMACS Technical Report 95-05
2. Beale EML, Forrest JJH (1976) Global optimization using special ordered sets. Math Program 10:52–69
3. Beale E, Tomlin J (1970) Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables. In: Lawrence J (ed) Proceedings of the 5th international operations research conference. Tavistock Publications, London, pp 447–454
4. Borndörfer R, Schlechte T (2007) Models for railway track allocation. In: Liebchen C, Ahuja RK, Mesa JA (eds) ATMOS 2007—7th workshop on algorithmic approaches for transportation modeling, optimization, and systems, Dagstuhl seminar proceedings. internationales begegnungs- und forschungszentrum für informatik (IBFI), Schloss Dagstuhl, Germany. http://drops.dagstuhl.de/opus/volltexte/2007/1170
5. Borndörfer R, Grötschel M, Lukac S, Mitusch K, Schlechte T, Schultz S, Tanner A (2006) An auctioning approach to railway slot allocation. Compet Regul Netw Ind 1(2):163–196. ZIB Report 05-45 at http://opus.kobv.de/zib/volltexte/2005/878/