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.

Handbook of combinatorial optimization

Author: Dingzhu Du
Publisher: Springer Science & Business Media
ISBN: 0792352858
Release Date: 1998-12-15
Genre: Science

Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In addi tion, linear programming relaxations are often the basis for many approxi mation algorithms for solving NP-hard problems (e.g. dual heuristics)."

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.

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.

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).

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.

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.

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: 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.

Applications of Combinatorial Optimization

Author: Vangelis Th. Paschos
Publisher: John Wiley & Sons
ISBN: 9781118600115
Release Date: 2013-02-07
Genre: Mathematics

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 aimsto cover a wide range of topics in this area. These topics alsodeal with fundamental notions and approaches as with severalclassical applications of combinatorial optimization. “Applications of Combinatorial Optimization” ispresenting a certain number among the most common and well-knownapplications of Combinatorial Optimization.

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.

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.

Nested Partitions Method Theory and Applications

Author: Leyuan Shi
Publisher: Springer Science & Business Media
ISBN: 9780387719092
Release Date: 2008-10-30
Genre: Mathematics

Thesubjectofthisbookisthenested partitions method(NP),arelativelynew optimization method that has been found to be very e?ective solving discrete optimization problems. Such discrete problems are common in many practical applications and the NP method is thus useful in diverse application areas. It can be applied to both operational and planning problems and has been demonstrated to e?ectively solve complex problems in both manufacturing and service industries. To illustrate its broad applicability and e?ectiveness, in this book we will show how the NP method has been successful in solving complex problems in planning and scheduling, logistics and transportation, supply chain design, data mining, and health care. All of these diverse app- cationshaveonecharacteristicincommon:theyallleadtocomplexlarge-scale discreteoptimizationproblemsthatareintractableusingtraditionaloptimi- tion methods. 1.1 Large-Scale Optimization IndevelopingtheNPmethodwewillconsideroptimization problemsthatcan be stated mathematically in the following generic form: minf(x), (1.1) x?X where the solution space or feasible region X is either a discrete or bounded ? set of feasible solutions. We denote a solution to this problem x and the ? ? objective function value f = f (x ).

Concepts of Combinatorial Optimization

Author: Vangelis Th. Paschos
Publisher: John Wiley & Sons
ISBN: 9781118600238
Release Date: 2012-12-27
Genre: Mathematics

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 Optimizationseries aims to cover a wide range of topics in this area. Thesetopics also deal with fundamental notions and approaches as withseveral classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided intothree parts: On the complexity of combinatorial optimization problems, thatpresents basics about worst-case and randomized complexity; Classical solution methods, that presents the two most-knownmethods for solving hard combinatorial optimization problems, thatare Branch-and-Bound and Dynamic Programming; Elements from mathematical programming, that presentsfundamentals from mathematical programming based methods that arein the heart of Operations Research since the origins of thisfield.