
Combinatorial optimization: algorithms and complexity
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.
- Genres
- Combinatorial optimization, Mathematical optimization, Computational complexity, Combinatorial analysis, Qa402.5 .p37
- Author
- Christos H. Papadimitriou
- Pages
- 496
Where to find it
Some links are affiliate links: if you buy, the site may receive a commission at no extra cost to you.







