{"title":"Series: Wiley Series in Discrete Mathematics \u0026 Optimization","description":null,"products":[{"product_id":"theory-of-linear-and-integer-programming-by-alexander-schrijver-9780471982326","title":"Theory of Linear and Integer Programming","description":"\u003cdiv class=\"book-description\"\u003e\n\u003cp\u003e\u003cem\u003eTheory of Linear and Integer Programming\u003c\/em\u003e by Alexander Schrijver from the Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands, describes the theory of linear and integer programming and surveys the algorithms for linear and integer programming problems, focusing on complexity analysis.\u003c\/p\u003e\n\n\u003cp\u003eThis book aims to complement the more practically oriented books in this field. A special feature is the author's coverage of important recent developments in linear and integer programming. Applications to combinatorial optimisation are given, and the author also includes extensive historical surveys and bibliographies.\u003c\/p\u003e\n\n\u003cp\u003eThe book is intended for graduate students and researchers in operations research, mathematics, and computer science. It will also be of interest to mathematical historians.\u003c\/p\u003e\n\n\u003cp\u003eContents:\u003c\/p\u003e\n\n\u003cp\u003e1. Introduction and preliminaries\u003cbr\u003e\n2. Problems, algorithms, and complexity\u003cbr\u003e\n3. Linear algebra and complexity\u003cbr\u003e\n4. Theory of lattices and linear diophantine equations\u003cbr\u003e\n5. Algorithms for linear diophantine equations\u003cbr\u003e\n6. Diophantine approximation and basis reduction\u003cbr\u003e\n7. Fundamental concepts and results on polyhedra, linear inequalities, and linear programming\u003cbr\u003e\n8. The structure of polyhedra\u003cbr\u003e\n9. Polarity, and blocking and anti-blocking polyhedra\u003cbr\u003e\n10. Sizes and the theoretical complexity of linear inequalities and linear programming\u003cbr\u003e\n11. The simplex method\u003cbr\u003e\n12. Primal-dual, elimination, and relaxation methods\u003cbr\u003e\n13. Khachiyan's method for linear programming\u003cbr\u003e\n14. The ellipsoid method for polyhedra more generally\u003cbr\u003e\n15. Further polynomiality results in linear programming\u003cbr\u003e\n16. Introduction to integer linear programming\u003cbr\u003e\n17. Estimates in integer linear programming\u003cbr\u003e\n18. The complexity of integer linear programming\u003cbr\u003e\n19. Totally unimodular matrices: fundamental properties and examples\u003cbr\u003e\n20. Recognising total unimodularity\u003cbr\u003e\n21. Further theory related to total unimodularity\u003cbr\u003e\n22. Integral polyhedra and total dual integrality\u003cbr\u003e\n23. Cutting planes\u003cbr\u003e\n24. Further methods in integer linear programming\u003cbr\u003e\n25. Historical and further notes on integer linear programming\u003cbr\u003e\n26. References\u003cbr\u003e\n27. Notation index\u003cbr\u003e\n28. Author index\u003cbr\u003e\n29. Subject index\u003c\/p\u003e\n\u003c\/div\u003e","brand":"Unknown","offers":[{"title":"Default Title","offer_id":46855127138540,"sku":"9780471982326","price":207.99,"currency_code":"NZD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0705\/7784\/8556\/files\/9780471982326.jpg?v=1759263070"}],"url":"https:\/\/bookhero.co.nz\/collections\/series-wiley-series-in-discrete-mathematics-optimization.oembed","provider":"Book Hero","version":"1.0","type":"link"}