Book Reviews

Published Online:https://doi.org/10.1287/inte.32.3.91.38

References

  • Garey M. R., Johnson D. S.Computers and Intractability, A Guide to the Theory of NP-Completeness (1997) (W. H. Freeman and Company, New York) Google Scholar
  • Li M., Vitanyi P.An Introduction to Kolmogorov Complexity and Its Applications (1997) 2nd ed.(Springer, Berlin, Germany) CrossrefGoogle Scholar
  • Papadimitriou Ch. H., Steiglitz K.Combinatorial Optimization: Algorithms and Complexity (1998) (Dover Publishers, Mineola, New York) Google Scholar
  • Chandru V., Hooker J. N.Optimization Methods for Logical Inference (1999) (John Wiley and Sons, New York) CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.