Combinatorial Optimization

Algorithms and Complexity

Author: Christos H. Papadimitriou,Kenneth Steiglitz

Publisher: Courier Corporation

ISBN: 0486320138

Category: Mathematics

Page: 528

View: 8887

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.

Combinatorial Optimization

Theory and Algorithms

Author: Bernhard Korte,Jens Vygen

Publisher: Springer

ISBN: 3662560399

Category: Mathematics

Page: 698

View: 3435

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ɛ)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues to represent the state of the art of combinatorial optimization.

Combinatorial Optimization

Networks and Matroids

Author: Eugene Lawler

Publisher: Courier Corporation

ISBN: 048614366X

Category: Mathematics

Page: 400

View: 9750

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.

A First Course in Combinatorial Optimization

Author: Jon Lee

Publisher: Cambridge University Press

ISBN: 9780521010122

Category: Business & Economics

Page: 211

View: 6212

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.

Bioinspired Computation in Combinatorial Optimization

Algorithms and Their Computational Complexity

Author: Frank Neumann,Carsten Witt

Publisher: Springer Science & Business Media

ISBN: 3642165443

Category: Mathematics

Page: 216

View: 4132

Bioinspired computation methods such as evolutionary algorithms and ant colony optimization are being applied successfully to complex engineering problems and to problems from combinatorial optimization, and with this comes the requirement to more fully understand the computational complexity of these search heuristics. This is the first textbook covering the most important results achieved in this area. The authors study the computational complexity of bioinspired computation and show how runtime behavior can be analyzed in a rigorous way using some of the best-known combinatorial optimization problems -- minimum spanning trees, shortest paths, maximum matching, covering and scheduling problems. A feature of the book is the separate treatment of single- and multiobjective problems, the latter a domain where the development of the underlying theory seems to be lagging practical successes. This book will be very valuable for teaching courses on bioinspired computation and combinatorial optimization. Researchers will also benefit as the presentation of the theory covers the most important developments in the field over the last 10 years. Finally, with a focus on well-studied combinatorial optimization problems rather than toy problems, the book will also be very valuable for practitioners in this field.

Combinatorial Optimization

Polyhedra and Efficiency

Author: A. Schrijver

Publisher: Springer Science & Business Media

ISBN: 9783540443896

Category: Business & Economics

Page: 1881

View: 9913

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

Iterative Methods in Combinatorial Optimization

Author: Lap Chi Lau,R. Ravi,Mohit Singh

Publisher: Cambridge University Press

ISBN: 1139499394

Category: Computers

Page: N.A

View: 4828

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.

Probability Theory and Combinatorial Optimization

Author: J. Michael Steele

Publisher: SIAM

ISBN: 0898713803

Category: Mathematics

Page: 159

View: 1721

An introduction to the state of the art of the probability theory most applicable to combinatorial optimization. The questions that receive the most attention are those that deal with discrete optimization problems for points in Euclidean space, such as the minimum spanning tree, the traveling-salesman tour, and minimal-length matchings.

Parallel Combinatorial Optimization

Author: El-Ghazali Talbi

Publisher: John Wiley & Sons

ISBN: 0470053917

Category: Computers

Page: 363

View: 7614

This text provides an excellent balance of theory and application that enables you to deploy powerful algorithms, frameworks, and methodologies to solve complex optimization problems in a diverse range of industries. Each chapter is written by leading experts in the fields of parallel and distributed optimization. Collectively, the contributions serve as a complete reference to the field of combinatorial optimization, including details and findings of recent and ongoing investigations.

Combinatorial Optimization

Papers from the DIMACS Special Year

Author: William Cook,László Lovász,Paul D. Seymour

Publisher: American Mathematical Soc.

ISBN: 9780821870662

Category: Mathematics

Page: 441

View: 1375

This is a carefully refereed collection of invited survey articles written by outstanding researchers. Aimed at researchers in discrete mathematics, operations research, and the theory of computing, this book offers an in-depth look at many topics not treated in textbooks.

Applications of Combinatorial Optimization

Author: Vangelis Th. Paschos

Publisher: John Wiley & Sons

ISBN: 1119015243

Category: Mathematics

Page: 448

View: 6313

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts: - On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity; - Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; - Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.

Surveys in Combinatorial Optimization

Author: S. Martello,M. Minoux,C. Ribeiro,Gilbert Laporte

Publisher: Elsevier

ISBN: 9780080872438

Category: Mathematics

Page: 383

View: 4347

A collection of papers surveying recent progress in the field of Combinatorial Optimization. Topics examined include theoretical and computational aspects (Boolean Programming, Probabilistic Analysis of Algorithms, Parallel Computer Models and Combinatorial Algorithms), well-known combinatorial problems (such as the Linear Assignment Problem, the Quadratic Assignment Problem, the Knapsack Problem and Steiner Problems in Graphs) and more applied problems (such as Network Synthesis and Dynamic Network Optimization, Single Facility Location Problems on Networks, the Vehicle Routing Problem and Scheduling Problems).

Geometric Algorithms and Combinatorial Optimization

Author: Martin Grötschel,Laszlo Lovasz,Alexander Schrijver

Publisher: Springer Science & Business Media

ISBN: 3642978819

Category: Mathematics

Page: 362

View: 4488

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.

Local Search in Combinatorial Optimization

Author: Emile H. L. Aarts,J. K. Lenstra

Publisher: Princeton University Press

ISBN: 9780691115221

Category: Computers

Page: 512

View: 5613

In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting ever-increasing attention. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in reasonable time. Local Search in Combinatorial Optimization covers local search and its variants from both a theoretical and practical point of view, each topic discussed by a leading authority. This book is an important reference and invaluable source of inspiration for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management science. In addition to the editors, the contributors are Mihalis Yannakakis, Craig A. Tovey, Jan H. M. Korst, Peter J. M. van Laarhoven, Alain Hertz, Eric Taillard, Dominique de Werra, Heinz M�hlenbein, Carsten Peterson, Bo S�derberg, David S. Johnson, Lyle A. McGeoch, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Gerard A. P. Kindervater, Martin W. P. Savelsbergh, Edward J. Anderson, Celia A. Glass, Chris N. Potts, C. L. Liu, Peichen Pan, Iiro Honkala, and Patric R. J. �sterg�rd.

Advances in Combinatorial Optimization

Linear Programming Formulations of the Traveling Salesman and Other Hard Combinatorial Optimization Problems

Author: Moustapha Diaby,Mark H Karwan

Publisher: World Scientific

ISBN: 981470489X

Category: Mathematics

Page: 220

View: 3875

' Combinational optimization (CO) is a topic in applied mathematics, decision science and computer science that consists of finding the best solution from a non-exhaustive search. CO is related to disciplines such as computational complexity theory and algorithm theory, and has important applications in fields such as operations research/management science, artificial intelligence, machine learning, and software engineering. Advances in Combinatorial Optimization presents a generalized framework for formulating hard combinatorial optimization problems (COPs) as polynomial sized linear programs. Though developed based on the ''traveling salesman problem'' (TSP), the framework allows for the formulating of many of the well-known NP-Complete COPs directly (without the need to reduce them to other COPs) as linear programs, and demonstrates the same for three other problems (e.g. the ''vertex coloring problem'' (VCP)). This work also represents a proof of the equality of the complexity classes "P" (polynomial time) and "NP" (nondeterministic polynomial time), and makes a contribution to the theory and application of ''extended formulations'' (EFs). On a whole, Advances in Combinatorial Optimization offers new modeling and solution perspectives which will be useful to professionals, graduate students and researchers who are either involved in routing, scheduling and sequencing decision-making in particular, or in dealing with the theory of computing in general. Contents:IntroductionBasic IP Model Using the TSPBasic LP Model Using the TSPGeneric LP Modeling for COPsNon-Symmetry of the Basic (TSP) ModelNon-Applicability of Extended Formulations TheoryIllustrations for Other NP-Complete COPs Readership: Professionals, graduate students and researchers who are either involved in routing, scheduling and sequencing decision-making in particular, or in dealing with the theory of computing in general. Key Features:The book offers a new proof of the equality of the complexity classes "P" and "NP"Although our approach is developed using the framework of the TSP, it has natural analogs for the other problems in the NP-Complete class thus providing a unified framework for modeling many combinatorial optimization problems (COPs)The book makes a contribution to the theory and application of Extended Formulations (EFs) refining the notion of EFs by separating the case in which that notion is degenerate from the case in which the notion of EF is well defined/meaningful. It separates the case in which the addition of redundant constraints and variables (for the purpose of establishing EF relations) matters from the case in which the addition of redundant constraints and variables does not matterKeywords:Linear Programming;Convex Optimization;Combinatorial Optimization;Traveling Salesman Problem;NP-Complete Problems;P versus NP'

Combinatorial Optimization and Applications

4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings

Author: Weili Wu,Ovidiu Daescu

Publisher: Springer Science & Business Media

ISBN: 3642174604

Category: Computers

Page: 416

View: 4571

This book constitutes the refereed proceedings of the 4th International Conference on Combinatorial Optimization and Applications, COCOA 2010, held in Kailua-Kona, HI, USA, in December 2010. The 49 revised full papers were carefully reviewed and selected from 108 submissions.

Combinatorial Optimization

Author: M. M. Shikare,B. N. Waphare

Publisher: Alpha Science Int'l Ltd.

ISBN: 9788173195600

Category: Mathematics

Page: 225

View: 7399

Contributed papers presented at a national workshop held at Dept.of Mathematics, University of Pune.

Handbook of Combinatorial Optimization


Author: Ding-Zhu Du

Publisher: Springer Science & Business Media

ISBN: 9780792359241

Category: Computers

Page: 648

View: 3508

This volume can be considered as a supplementary volume to the major three-volume Handbook of Combinatorial Optimization published by Kluwer. It can also be regarded as a stand-alone volume which presents chapters dealing with various aspects of the subject including optimization problems and algorithmic approaches for discrete problems. Audience: All those who use combinatorial optimization methods to model and solve problems.