1. Aarts , E. and Lenstra , J. K. , Eds . 1997 . Local Search in Combinatorial Optimization. Wiley , New York.]] Aarts, E. and Lenstra, J. K., Eds. 1997. Local Search in Combinatorial Optimization. Wiley, New York.]]
2. Single machine job sequencing with precedence constraints;Adolphson D.;SIAM J. Comput.,1977
3. Optimal linear ordering;Adolphson D.;SIAM J. Appl. Mathem.,1973
4. λ1, isoperimetric inequalities for graphs and superconcentrators;Alon N.;J. Combinatorial Theory. Series B,1985
5. Àlvarez , C. , Cases , R. , Díaz , J. , Petit , J. , and Serna , M . 2000. Routing trees problems on random graphs. In Approximation and Randomized Algorithms in Communication Networks, J. Rolim et al ., Ed. ICALP Workshops 2000 . Carleton Scientific, 99--111.]] Àlvarez, C., Cases, R., Díaz, J., Petit, J., and Serna, M. 2000. Routing trees problems on random graphs. In Approximation and Randomized Algorithms in Communication Networks, J. Rolim et al., Ed. ICALP Workshops 2000. Carleton Scientific, 99--111.]]