1. Augmentation problems: Society for Industrial and Applied Mathematics (SIAM);Eswaran KP;Lecture Notes in Mathematics,1976
2. Heuristics for minimizing the maximum within-clusters distance;Fioruci JA;Pesquisa Operacional,2012
3. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey MR,1979
4. The Easiest Hard Problem: Number Partitioning;Hayes B;American Scientist,2002