Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization
Title | Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization PDF eBook |
Author | Levent Tunçel |
Publisher | American Mathematical Soc. |
Total Pages | 233 |
Release | 2016-05-05 |
Genre | Mathematics |
ISBN | 1470428113 |
Since the early 1960s, polyhedral methods have played a central role in both the theory and practice of combinatorial optimization. Since the early 1990s, a new technique, semidefinite programming, has been increasingly applied to some combinatorial optimization problems. The semidefinite programming problem is the problem of optimizing a linear function of matrix variables, subject to finitely many linear inequalities and the positive semidefiniteness condition on some of the matrix variables. On certain problems, such as maximum cut, maximum satisfiability, maximum stable set and geometric representations of graphs, semidefinite programming techniques yield important new results. This monograph provides the necessary background to work with semidefinite optimization techniques, usually by drawing parallels to the development of polyhedral techniques and with a special focus on combinatorial optimization, graph theory and lift-and-project methods. It allows the reader to rigorously develop the necessary knowledge, tools and skills to work in the area that is at the intersection of combinatorial optimization and semidefinite optimization. A solid background in mathematics at the undergraduate level and some exposure to linear optimization are required. Some familiarity with computational complexity theory and the analysis of algorithms would be helpful. Readers with these prerequisites will appreciate the important open problems and exciting new directions as well as new connections to other areas in mathematical sciences that the book provides.
Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization
Title | Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization PDF eBook |
Author | Levent Tunçel |
Publisher | |
Total Pages | |
Release | 2012 |
Genre | Combinatorial optimization |
ISBN | 9781470417901 |
Topics in Semidefinite and Interior-Point Methods
Title | Topics in Semidefinite and Interior-Point Methods PDF eBook |
Author | Panos M. Pardalos and Henry Wolkowicz |
Publisher | American Mathematical Soc. |
Total Pages | 276 |
Release | |
Genre | Interior-point methods |
ISBN | 9780821871256 |
This volume presents refereed papers presented at the workshop Semidefinite Programming and Interior-Point Approaches for Combinatorial Problems: held at The Fields Institute in May 1996. Semidefinite programming (SDP) is a generalization of linear programming (LP) in that the non-negativity constraints on the variables is replaced by a positive semidefinite constraint on matrix variables. Many of the elegant theoretical properties and powerful solution techniques follow through from LP to SDP. In particular, the primal-dual interior-point methods, which are currently so successful for LP, can be used to efficiently solve SDP problems. In addition to the theoretical and algorithmic questions, SDP has found many important applications in combinatorial optimization, control theory and other areas of mathematical programming. The papers in this volume cover a wide spectrum of recent developments in SDP. The volume would be suitable as a textbook for advanced courses in optimization. It is intended for graduate students and researchers in mathematics, computer science, engineering and operations.
Recent Advances in Algorithms and Combinatorics
Title | Recent Advances in Algorithms and Combinatorics PDF eBook |
Author | Bruce A. Reed |
Publisher | Springer Science & Business Media |
Total Pages | 357 |
Release | 2006-05-17 |
Genre | Mathematics |
ISBN | 0387224440 |
Excellent authors, such as Lovasz, one of the five best combinatorialists in the world; Thematic linking that makes it a coherent collection; Will appeal to a variety of communities, such as mathematics, computer science and operations research
Integer Programming and Combinatorial Optimization
Title | Integer Programming and Combinatorial Optimization PDF eBook |
Author | Karen Aardal |
Publisher | Springer Science & Business Media |
Total Pages | 432 |
Release | 2001-05-30 |
Genre | Business & Economics |
ISBN | 3540422250 |
This book constitutes the reviewed proceedings of the 8th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2001, held in Utrecht, The Netherlands in June 2001. The 32 revised full papers presented were carefully reviewed and selected from a total of 108 submissions. The proceedings reflect most current directions in integer programming and optimization research. Among the topics covered are approximation algorithms, branch and bound algorithms, computational biology, computational complexity, algorithmic geometry, cutting plane algorithms, diophantine equations, geometry of members, graph and network algorithms, online algorithms, polyhedral combinatorics, scheduling theory and algorithms, and semidefinite programs.
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
Title | Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization PDF eBook |
Author | International Computer Science Institute |
Publisher | |
Total Pages | 37 |
Release | 1993 |
Genre | Combinatorial optimization |
ISBN |
Abstract: "We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to SDP. Next we present an interior point algorithm which converges to the optimal solution in polynomial time. The approach is a direct extension of Ye's projective method for linear programming. We also argue that most known interior point methods for linear programs can be transformed in a mechanical way to algorithms for SDP with proofs of convergence and polynomial time complexity also carrying over in a similar fashion. Finally we study the significance of these results in a variety of combinatorial optimization problems including the general 0-1 integer programs, the maximum clique and maximum stable set problems in perfect graphs, the maximum k-partite subgraph problem in graphs, and various graph partitioning and cut problems. As a result, we present barrier oracles for certain combinatorial optimization problems (in particular, clique and stable set problem for perfect graphs) whose linear programming formulation requires exponentially many inequalities. Existence of such barrier oracles refutes the commonly believed notion that in order to solve a combinatorial optimization problem with interior point methods, one needs its linear programming formulation explicitly."
Computational Combinatorial Optimization
Title | Computational Combinatorial Optimization PDF eBook |
Author | Michael Jünger |
Publisher | Springer Science & Business Media |
Total Pages | 317 |
Release | 2001-11-21 |
Genre | Mathematics |
ISBN | 3540428771 |
This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.