Hofman, R. (2006). Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time.
Style de citation Chicago (17e éd.)Hofman, Radoslaw. Why Linear Programming Cannot Solve Large Instances of NP-complete Problems in Polynomial Time. 2006.
Style de citation MLA (9e éd.)Hofman, Radoslaw. Why Linear Programming Cannot Solve Large Instances of NP-complete Problems in Polynomial Time. 2006.
Attention : ces citations peuvent ne pas être correctes à 100%.