Combinatorial optimization
algorithms and complexity
by Christos H. Papadimitriou · first published 1981
3mentions
1recommended by
3HN commenters
2010–2024first – last mentioned
33% recommend67% neutral
Christos H. Papadimitriou and Kenneth Steiglitz have combined the theory of computational complexity developed by computer scientists, and the foundations of mathematical programming developed by the operations research community. This text will be useful to students with a wide range of backgrounds, including computer science, operations research, and electrical engineering.
Affiliate links. As an Amazon Associate I earn from qualifying purchases.
…systems emphasis: Applied Combinatorics by Alan Tucker misc other sources: * graph theory: https://diestel-graph-theory.com/ * Harris' Combinatorics and Graph Theory * Graph Theory by Douglas B West * combinatorial Optimization by Papadimitriou and Steiglitz
on “Ask HN: What are some good dedicated textbooks on Graph Theory?” ↗…non-linear mathematical optimization is most more typical for many machine learning applications. Many pratical applications in scheduling, logistics, planning etc used linear (integer) programming and combinatorial optimization. The following are some points towards that body of literature. Alexander Schrijver [1] has lecture notes on Combinatorial Optimization on his website [2]. He also has an affordable 1800 page three volume…
on “Ask HN: Literature for mathematical optimization?” ↗I really enjoyed Solar, and really anything from Ian McEwan. Ammaniti is good fun too. But currently I'm reading mostly books for classes; Combinatorial Optimization by Papadimitriou and Spivak's Calculus on Manifolds, Solid State Physics, Introduction to Linear Analysis, Measure and Integration Theory, Lectures on the Coupling Method, Particles and Nuclei etc...
on “Ask HN: What are you reading right now?” ↗