Cover of Integer and combinatorial optimization

Integer and combinatorial optimization

by George L. Nemhauser · first published 1988

8mentions
2recommended by
4HN commenters
2013–2022first – last mentioned

50% recommend50% neutral

"A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such formulations, as well as for understanding the structure of and solving the resulting integer programming problems."--Computing Reviews.

Affiliate links. As an Amazon Associate I earn from qualifying purchases.

Mentions per year

20 2007: 0 mentions2008: 0 mentions2009: 0 mentions2010: 0 mentions2011: 0 mentions2012: 0 mentions2013: 2 mentions2014: 0 mentions2015: 1 mention2016: 1 mention2017: 0 mentions2018: 0 mentions2019: 1 mention2020: 0 mentions2021: 1 mention2022: 1 mention2023: 0 mentions2024: 0 mentions2025: 0 mentions2026: 0 mentions200720172026

What Hacker News says

  • graycat · Jul 7, 2015 · Recommends

    …research optimization is enormous, going back to the 1950s. The best of that literature is quite well written. For combinatorial optimization, there is George L. Nemhauser and Laurence A. Wolsey, 'Integer and Combinatorial Optimization', ISBN 0-471-35943-2, John Wiley & Sons, Inc., New York, 1999. The details of optimization are not always trivial, and several fairly challenging graduate applied math courses, complete with non-trivial…

    on “Google Optimization Tools” ↗
  • thxg · Jul 3, 2021 · Recommends

    …textbooks I liked much, for theory. If you're interested in discrete optimization too (the other half of math optimization), the classics are: "Optimization Over Integers" by Bertsimas & Weismantel "Integer and Combinatorial Optimization" by Nemhauser & Wolsey

    on “Ask HN: Literature for mathematical optimization?” ↗
  • graycat · Jun 19, 2013 · Mentions

    …on how far are away from an optimal solution; such duality theory is what yielded the bound of 0.025% above. For combinatorial optimization there is, say, George L. Nemhauser and Laurence A. Wolsey, 'Integer and Combinatorial Optimization', ISBN 0-471-35943-2, John Wiley & Sons, Inc., New York. William J. Cook, William H. Cunningham, William R. Pulleyblank, and Alexander Schrijver, 'Combinatorial Optimization', ISBN 0-471-55894-X, John…

    on “Discrete Optimization course begins today” ↗
  • antman · Jun 23, 2013 · Mentions

    …techniques are indeed very successful in practice and I hope that you will also enjoy these lectures. They make up a third of the class. The references Integer Programming by Laurence A. Wolsey Integer and Combinatorial Optimization by Laurence A. Wolsey, George L. Nemhauser Large Scale Linear and Integer Optimization: A Unified Approach by Richard Kipp Martin Introduction to Linear Optimization by Dimitris Bertsimas, John…

    on “Discrete Optimization course begins today” ↗
  • graycat · Oct 16, 2019 · Mentions

    …Disclosure: Minty was one of my professors. Since I have mentioned integer linear programming, I should include a reference, e.g. (with my TeX markup) George L.\ Nemhauser and Laurence A.\ Wolsey, {\it Integer and Combinatorial Optimization,\/} ISBN 0-471-35943-2, John Wiley \& Sons, Inc., New York, 1999.\ \ Disclosure: At one time Nemhauser gave me three words of advice, and that was the main direction for my Ph.D. dissertation. Yes,…

    on “My 2019 Mathematics a to Z: Linear Programming” ↗
  • merraksh · Jun 6, 2016 · Mentions

    …Tsitsiklis. Introduction to linear optimization. Vol. 6. Belmont, MA: Athena Scientific, 1997. [6] L.A. Wolsey (1998). Integer programming (Vol. 42). New York: Wiley. [7] L.A. Wolsey, G.L. Nemhauser. Integer and combinatorial optimization. John Wiley & Sons; 2014 Aug 28. [8] M. Conforti, G. Cornuéjols, G. Zambelli (2014). Integer programming (Vol. 271). Berlin: Springer.

    on “Linear Programming: How Does It Work?” ↗
  • graycat · Feb 13, 2013 · Mentions

    …at Johns Hopkins on designing a large IP network, e.g., a big chunk of the Internet. Yes, it's a big problem in 'combinatorial' optimization as in, say, George L. Nemhauser and Laurence A. Wolsey, 'Integer and Combinatorial Optimization', ISBN 0-471-35943-2, John Wiley & Sons, Inc., New York, 1999. Yes, these problems are apparently the original motivations for the question of P versus NP. At times companies have tried to attack this…

    on “Industrial Mathematics” ↗
  • graycat · Mar 10, 2022 · Mentions

    …the now old work of G. Nemhauser. His work was for combinatorial optimization and not just for exactly the traveling salesman problem (TSP). E.g., there is George L. Nemhauser and Laurence A. Wolsey, Integer and Combinatorial Optimization, ISBN 0-471-35943-2, John Wiley & Sons, Inc., New York, 1999. Some approaches involve set covering and set partitioning. Soooo, for the FedEx fleet, first just generate all single airplane feasible…

    on “Transformers, originally designed to handle language, are taking on vision” ↗

Keyboard shortcuts

/
Focus search
j / k
Next / previous book
Enter
Open focused book
Esc
Close / go back
g h
Go to Home
g t
Go to Top all-time
g m
Go to Most recommended
g r
Go to Rising
g f
Go to For You
?
Show this help