1) NEMHAUSER, George L.; WOLSEY, Laurence A., Integer and combinatorial optimization., New York: Wiley, 1988. xiv, 763p. - ((Wiley-Interscience series in discrete mathematics and optimization)) ISBN 047182819X : (enc.)
2) PAPADIMITRIOU, Christos H.; STEIGLITZ, Kenneth., Combinatorial optimization: algorithms and complexity, Mineola, N.Y.: Dover, 1998. xvi, 496 p. ISBN 0486402584 (broch.) .
3) WOLSEY, Laurence A., Integer programming., New York, N.Y.: John Wiley & Sons, 1998. xviii, 264 p. (Wiley-Interscience series in discrete mathematics and optimization). ISBN 9780471283669 (enc.).
4) MICHALEWICZ, Zbigniew.; FOGEL, David B, How to solve it: modern heuristics, Berlin; New York, N.Y.: Springer, c2000. 467 p. ISBN 3540660615 (enc.)
5) GOLUB, Gene H.; VAN LOAN, Charles F. Matrix computations. 3rd ed. Baltimore [Estados Unidos]; London: Johns Hopkins University, 1996.