| Author | : Christos H. Papadimitriou |
| Publisher | : Courier Corporation |
| Total Pages | : 530 |
| Release | : 2013-04-26 |
| Genre | : Mathematics |
| ISBN | : 0486320138 |
This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition.
| Author | : Bernhard Korte |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 596 |
| Release | : 2006-01-27 |
| Genre | : Mathematics |
| ISBN | : 3540292977 |
This well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete (but concise) proofs, as well as many deep results, some of which have not appeared in any previous books.
| Author | : Eugene Lawler |
| Publisher | : Courier Corporation |
| Total Pages | : 404 |
| Release | : 2012-10-16 |
| Genre | : Mathematics |
| ISBN | : 048614366X |
Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity.
| Author | : Martin Grötschel |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 374 |
| Release | : 2012-12-06 |
| Genre | : Mathematics |
| ISBN | : 3642978819 |
Historically, there is a close connection between geometry and optImization. This is illustrated by methods like the gradient method and the simplex method, which are associated with clear geometric pictures. In combinatorial optimization, however, many of the strongest and most frequently used algorithms are based on the discrete structure of the problems: the greedy algorithm, shortest path and alternating path methods, branch-and-bound, etc. In the last several years geometric methods, in particular polyhedral combinatorics, have played a more and more profound role in combinatorial optimization as well. Our book discusses two recent geometric algorithms that have turned out to have particularly interesting consequences in combinatorial optimization, at least from a theoretical point of view. These algorithms are able to utilize the rich body of results in polyhedral combinatorics. The first of these algorithms is the ellipsoid method, developed for nonlinear programming by N. Z. Shor, D. B. Yudin, and A. S. NemirovskiI. It was a great surprise when L. G. Khachiyan showed that this method can be adapted to solve linear programs in polynomial time, thus solving an important open theoretical problem. While the ellipsoid method has not proved to be competitive with the simplex method in practice, it does have some features which make it particularly suited for the purposes of combinatorial optimization. The second algorithm we discuss finds its roots in the classical "geometry of numbers", developed by Minkowski. This method has had traditionally deep applications in number theory, in particular in diophantine approximation.
| Author | : Laurence A. Wolsey |
| Publisher | : John Wiley & Sons |
| Total Pages | : 782 |
| Release | : 2014-08-28 |
| Genre | : Mathematics |
| ISBN | : 1118626869 |
Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION "This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list."-Optima "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 "[This book] can serve as a basis for various graduate courses on discrete optimization as well as a reference book for researchers and practitioners."-Mathematical Reviews "This comprehensive and wide-ranging book will undoubtedly become a standard reference book for all those in the field of combinatorial optimization."-Bulletin of the London Mathematical Society "This text should be required reading for anybody who intends to do research in this area or even just to keep abreast of developments."-Times Higher Education Supplement, London Also of interest . . . INTEGER PROGRAMMING Laurence A. Wolsey Comprehensive and self-contained, this intermediate-level guide to integer programming provides readers with clear, up-to-date explanations on why some problems are difficult to solve, how techniques can be reformulated to give better results, and how mixed integer programming systems can be used more effectively. 1998 (0-471-28366-5) 260 pp.
| Author | : Ding-Zhu Du |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 395 |
| Release | : 2006-08-18 |
| Genre | : Business & Economics |
| ISBN | : 0387238301 |
This is a supplementary volume to the major three-volume Handbook of Combinatorial Optimization set. It can also be regarded as a stand-alone volume presenting chapters dealing with various aspects of the subject in a self-contained way.
| Author | : Alexander Schrijver |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 2024 |
| Release | : 2003-02-12 |
| Genre | : Business & Economics |
| ISBN | : 9783540443896 |
From the reviews: "About 30 years ago, when I was a student, the first book on combinatorial optimization came out referred to as "the Lawler" simply. I think that now, with this volume Springer has landed a coup: "The Schrijver". The box is offered for less than 90.- EURO, which to my opinion is one of the best deals after the introduction of this currency." OR-Spectrum
| Author | : Lap Chi Lau |
| Publisher | : Cambridge University Press |
| Total Pages | : 255 |
| Release | : 2011-04-18 |
| Genre | : Computers |
| ISBN | : 1139499394 |
With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.
| Author | : Jon Lee |
| Publisher | : Cambridge University Press |
| Total Pages | : 232 |
| Release | : 2004-02-09 |
| Genre | : Business & Economics |
| ISBN | : 9780521010122 |
A First Course in Combinatorial Optimization is a text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.
