Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Author: Tobias Achterberg
Publisher: Springer Science & Business Media
ISBN: 9783642213106
Release Date: 2011-05-13
Genre: Business & Economics

This book constitutes the refereed proceedings of the 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2011, held in Berlin, Germany, in May 2011. The 13 revised full papers and 7 revised short papers presented together with 3 invited lectures were carefully reviewed and selected from 35 submissions. The papers are focused on both theoretical and practical, application-oriented issues and present current research with a special focus on the integration and hybridization of the approaches of constraint programming, artificial intelligence, and operations research technologies for solving large scale and complex real life combinatorial optimization problems.

Computational Combinatorial Optimization

Author: Michael Jünger
Publisher: Springer
ISBN: 9783540455868
Release Date: 2003-06-30
Genre: Mathematics

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.

Iterative Methods in Combinatorial Optimization

Author: Lap Chi Lau
Publisher: Cambridge University Press
ISBN: 9781139499392
Release Date: 2011-04-18
Genre: Computers

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.

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Author: Carla Gomes
Publisher: Springer
ISBN: 9783642381713
Release Date: 2013-04-11
Genre: Computers

This volume is a compilation of the research program of the 10th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, CPAIOR 2013, held at Yorktown Heights, NY, USA, in May 2013. This volume contains 20 full papers and 11 short papers that were carefully reviewed and selected from 71 submissions. The papers focus on new techniques or applications in the intersection of constraint programming (CP), artificial intelligence (AI) and operations research (OR).

Parallel Combinatorial Optimization

Author: El-Ghazali Talbi
Publisher: John Wiley & Sons
ISBN: 9780470053911
Release Date: 2006-10-27
Genre: Computers

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.

Integer Programming and Combinatorial Optimization

Author: Matteo Fischetti
Publisher: Springer
ISBN: 9783540727927
Release Date: 2007-06-26
Genre: Computers

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.

Data Correcting Approaches in Combinatorial Optimization

Author: Boris Goldengorin
Publisher: Springer Science & Business Media
ISBN: 9781461452850
Release Date: 2012-10-11
Genre: Computers

​​​​​​​​​​​​​​​​​Data Correcting Approaches in Combinatorial Optimization focuses on algorithmic applications of the well known polynomially solvable special cases of computationally intractable problems. The purpose of this text is to design practically efficient algorithms for solving wide classes of combinatorial optimization problems. Researches, students and engineers will benefit from new bounds and branching rules in development efficient branch-and-bound type computational algorithms. This book examines applications for solving the Traveling Salesman Problem and its variations, Maximum Weight Independent Set Problem, Different Classes of Allocation and Cluster Analysis as well as some classes of Scheduling Problems. Data Correcting Algorithms in Combinatorial Optimization introduces the data correcting approach to algorithms which provide an answer to the following questions: how to construct a bound to the original intractable problem and find which element of the corrected instance one should branch such that the total size of search tree will be minimized. The PC time needed for solving intractable problems will be adjusted with the requirements for solving real world problems.​

Integer Programming and Combinatorial Optimization

Author: William J. Cook
Publisher: Springer Science & Business Media
ISBN: 9783540436768
Release Date: 2002-05-14
Genre: Computers

This research monograph deals with the study of wave phenomena caused by winds in the world's oceans. Particular attention is paid to modern developments that take into account the propagation of ocean waves at global distances and their interaction with the sea bottom, ocean currents and the ice cover. With this book the author provides the first methodical presentation of the generation, evolution and propagation of wind-induced ocean waves.

Combinatorial Optimization

Author: Vašek Chvátal
Publisher: IOS Press
ISBN: 9781607507185
Release Date: 2011
Genre: Computers

"Published in cooperation with NATO Emerging Security Challenges Division."

Integration of AI and OR Techniques in Constraint Programming

Author: Helmut Simonis
Publisher: Springer
ISBN: 9783319070469
Release Date: 2014-05-12
Genre: Computers

This book constitutes the proceedings of the International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, CPAIOR 2014, held in Cork, Ireland, in May 2014. The 33 papers presented in this volume were carefully reviewed and selected from 70 submissions. The papers focus on constraint programming and global constraints; scheduling modelling; encodings and SAT logistics; MIP; CSP and complexity; parallelism and search; and data mining and machine learning.

Integer Programming and Combinatorial Optimization

Author: Andrea Lodi
Publisher: Springer Science & Business Media
ISBN: 9783540688860
Release Date: 2008-05-08
Genre: Computers

This book constitutes the refereed proceedings of the 13th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2008, held in Bertinoro, Italy, in May 2008. The 32 revised full papers presented were carefully reviewed and selected from 95 submissions. The papers cover various aspects of integer programming and combinatorial optimization and present recent developments in theory, computation, and applications in that area. Topics included are such as approximation algorithms, branch and bound algorithms, branch and cut algorithms, computational biology, computational complexity, computational geometry, cutting plane algorithms, diophantine equations, geometry of numbers, graph and network algorithms, integer programming, matroids and submodular functions, on-line algorithms and competitive analysis, polyhedral combinatorics, randomized algorithms, random graphs, scheduling theory and scheduling algorithms, and semidefinite programs.

Integer Programming and Combinatorial Optimization

Author: Oktay Günlük
Publisher: Springer Science & Business Media
ISBN: 9783642208065
Release Date: 2011-05-10
Genre: Computers

This book constitutes the proceedings of the 15th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2011, held in New York, USA in June 2011. The 33 papers presented were carefully reviewed and selected from 110 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization with the aim to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.

Combinatorial Optimization

Author: Bernhard Korte
Publisher: Springer Science & Business Media
ISBN: 9783540718444
Release Date: 2007-11-04
Genre: Mathematics

Now fully updated in a third edition, this is a comprehensive textbook on combinatorial optimization. It puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete but concise proofs, also for many deep results, some of which have not appeared in print before. Recent topics are covered as well, and numerous references are provided. This third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added.