1. Bley A. Routing and capacity optimization for IP networks. PhD thesis, Technische Universität, Berlin; 2007.
2. Boland N, Bley A, Fricke C, Froyland G, Sotirov R. Clique-based facets for the precedence constrained knapsack problem. Optimization Online, October 2009.
3. Bomze I, Budinich M, Pardalos P, Pelillo M. The maximum clique problem. In: Handbook of combinatorial optimization, vol. 4. Dordrecht: Kluwer Academic Press; 1999.
4. Borndörfer R, Kormos Z. An algorithm for maximum cliques. Unpublished working paper, Konrad-Zuse-Zentrum für Informationstechnik Berlin, 1997.
5. Polyhedral results for the precedence-constrained knapsack problem;Andrew Boyd;Discrete Applied Mathematics,1993