Integer and Combinatorial Optimization
Title | Integer and Combinatorial Optimization PDF eBook |
Author | Laurence A. Wolsey |
Publisher | John Wiley & Sons |
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.
Problems and Solutions for Integer and Combinatorial Optimization
Title | Problems and Solutions for Integer and Combinatorial Optimization PDF eBook |
Author | Mustafa Ç. Pınar |
Publisher | SIAM |
Pages | 148 |
Release | 2023-11-10 |
Genre | Mathematics |
ISBN | 1611977762 |
The only book offering solved exercises for integer and combinatorial optimization, this book contains 102 classroom tested problems of varying scope and difficulty chosen from a plethora of topics and applications. It has an associated website containing additional problems, lecture notes, and suggested readings. Topics covered include modeling capabilities of integer variables, the Branch-and-Bound method, cutting planes, network optimization models, shortest path problems, optimum tree problems, maximal cardinality matching problems, matching-covering duality, symmetric and asymmetric TSP, 2-matching and 1-tree relaxations, VRP formulations, and dynamic programming. Problems and Solutions for Integer and Combinatorial Optimization: Building Skills in Discrete Optimization is meant for undergraduate and beginning graduate students in mathematics, computer science, and engineering to use for self-study and for instructors to use in conjunction with other course material and when teaching courses in discrete optimization.
Integer Programming and Combinatorial Optimization
Title | Integer Programming and Combinatorial Optimization PDF eBook |
Author | Matteo Fischetti |
Publisher | Springer |
Pages | 509 |
Release | 2007-06-26 |
Genre | Computers |
ISBN | 3540727922 |
This book constitutes the refereed proceedings of the 12th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2007, held in Ithaca, NY, USA, in June 2007. Among the topics addressed in the 36 revised full papers are approximation algorithms, algorithmic game theory, computational biology, integer programming, polyhedral combinatorics, scheduling theory and scheduling algorithms, as well as semidefinite programs.
Applied Integer Programming
Title | Applied Integer Programming PDF eBook |
Author | Der-San Chen |
Publisher | John Wiley & Sons |
Pages | 489 |
Release | 2011-09-20 |
Genre | Mathematics |
ISBN | 1118210026 |
An accessible treatment of the modeling and solution of integer programming problems, featuring modern applications and software In order to fully comprehend the algorithms associated with integer programming, it is important to understand not only how algorithms work, but also why they work. Applied Integer Programming features a unique emphasis on this point, focusing on problem modeling and solution using commercial software. Taking an application-oriented approach, this book addresses the art and science of mathematical modeling related to the mixed integer programming (MIP) framework and discusses the algorithms and associated practices that enable those models to be solved most efficiently. The book begins with coverage of successful applications, systematic modeling procedures, typical model types, transformation of non-MIP models, combinatorial optimization problem models, and automatic preprocessing to obtain a better formulation. Subsequent chapters present algebraic and geometric basic concepts of linear programming theory and network flows needed for understanding integer programming. Finally, the book concludes with classical and modern solution approaches as well as the key components for building an integrated software system capable of solving large-scale integer programming and combinatorial optimization problems. Throughout the book, the authors demonstrate essential concepts through numerous examples and figures. Each new concept or algorithm is accompanied by a numerical example, and, where applicable, graphics are used to draw together diverse problems or approaches into a unified whole. In addition, features of solution approaches found in today's commercial software are identified throughout the book. Thoroughly classroom-tested, Applied Integer Programming is an excellent book for integer programming courses at the upper-undergraduate and graduate levels. It also serves as a well-organized reference for professionals, software developers, and analysts who work in the fields of applied mathematics, computer science, operations research, management science, and engineering and use integer-programming techniques to model and solve real-world optimization problems.
Handbook of combinatorial optimization. 1
Title | Handbook of combinatorial optimization. 1 PDF eBook |
Author | Dingzhu Du |
Publisher | Springer Science & Business Media |
Pages | 808 |
Release | 1998 |
Genre | Mathematics |
ISBN | 9780792350187 |
The first of a multi-volume set, which deals with several algorithmic approaches for discrete problems as well as many combinatorial problems. It is addressed to researchers in discrete optimization, and to all scientists who use combinatorial optimization methods to model and solve problems.
Integer Optimization by Local Search
Title | Integer Optimization by Local Search PDF eBook |
Author | Joachim P. Walser |
Publisher | Springer |
Pages | 146 |
Release | 2003-06-26 |
Genre | Computers |
ISBN | 3540483691 |
Integer Optimization addresses a wide spectrum of practically important optimization problems and represents a major challenge for algorithmics. The goal of integer optimization is to solve a system of constraints and optimization criteria over discrete variables. Integer Optimization by Local Search introduces a new approach to domain-independent integer optimization, which, unlike traditional strategies, is based on local search. It develops the central concepts and strategies of integer local search and describes possible combinations with classical methods from linear programming. The surprising effectiveness of the approach is demonstrated in a variety of case studies on large-scale, realistic problems, including production planning, timetabling, radar surveillance, and sports scheduling. The monograph is written for practitioners and researchers from artificial intelligence and operations research.
Integer Programming and Combinatorial Optimization
Title | Integer Programming and Combinatorial Optimization PDF eBook |
Author | George Nemhauser |
Publisher | Springer |
Pages | 453 |
Release | 2004-07-27 |
Genre | Mathematics |
ISBN | 3540259600 |
This volume contains the papers accepted for publication at IPCO X, the Tenth International Conference on Integer Programming and Combinatorial Optimization, held in New York City, New York, USA, June 7-11, 2004. The IPCO series of conferences presents recent results in theory, computation and applications of integer programming and combinatorial optimization. These conferences are sponsored by the Mathematical Programming Society, and are held in those years in which no International Symposium on Mathematical Programming takes place. IPCO VIII was held in Utrecht (The Netherlands) and IPCO IX was held in Cambridge (USA). A total of 109 abstracts, mostly of very high quality, were submitted. The Program Committee accepted 32, in order to meet the goal of having three days of talks with no parallel sessions. Thus, many excellent abstracts could not be accepted. The papers in this volume have not been refereed. It is expected that revised versions of the accepted papers will be submitted to standard scientific journals for publication. The Program Committee thanks all authors of submitted manuscripts for their support of IPCO. March 2004 George Nemhauser Daniel Bienstock Organization IPCO X was hosted by the Computational Optimization Research Center (CORC), Columbia University.