John N. Hooker – författare

Integrated Methods for Optimization integrates the key concepts of Mathematical Programming and Constraint Programming into a unified framework that allows them to be generalized and combined. The unification of MP and CP creates optimization methods that have much greater modeling power, increased computational speed, and a sizeable reduction computational coding. Hence the benefits of this integration are substantial, providing the Applied Sciences with a powerful, high-level modeling solution for optimization problems. As reviewers of the book have noted, this integration along with constraint programming being incorporated into a number of programming languages, brings the field a step closer to being able to simply state a problem and having the computer solve it.

John Hooker is a leading researcher in both the Optimization and Constraint Programming research communities. He has been an instrumental principal for this integration, and over the years, he has given numerous presentations and tutorials on the integration of these two areas. It is felt by many in the field that the future Optimization courses will increasingly be taught from this integrated framework.

Integrated Methods for Optimization integrates the key concepts of Mathematical Programming and Constraint Programming into a unified framework that allows them to be generalized and combined. The unification of MP and CP creates optimization methods that have much greater modeling power, increased computational speed, and a sizeable reduction computational coding. Hence the benefits of this integration are substantial, providing the Applied Sciences with a powerful, high-level modeling solution for optimization problems. As reviewers of the book have noted, this integration along with constraint programming being incorporated into a number of programming languages, brings the field a step closer to being able to simply state a problem and having the computer solve it.John Hooker is a leading researcher in both the Optimization and Constraint Programming research communities. He has been an instrumental principal for this integration, and over the years, he has given numerous presentations and tutorials on the integration of these two areas. It is felt by many in the field that the future Optimization courses will increasingly be taught from this integrated framework.

The first edition of Integrated Methods for Optimization was published in January 2007. Because the book covers a rapidly developing field, the time is right for a second edition. The book provides a unified treatment of optimization methods. It brings ideas from mathematical programming (MP), constraint programming (CP), and global optimization (GO)into a single volume. There is no reason these must be learned as separate fields, as they normally are, and there are three reasons they should be studied together. (1) There is much in common among them intellectually, and to a large degree they can be understood as special cases of a single underlying solution technology. (2) A growing literature reports how they can be profitably integrated to formulate and solve a wide range of problems. (3) Several software packages now incorporate techniques from two or more of these fields.The book provides a unique resource for graduate students and practitioners who want a well-rounded background in optimization methods within a single course of study. Engineering students are a particularly large potential audience, because engineering optimization problems often benefit from a combined approach—particularly where design, scheduling, or logistics are involved. The text is also of value to those studying operations research, because their educational programs rarely cover CP, and to those studying computer science and artificial intelligence (AI), because their curricula typically omit MP and GO. The text is also useful for practitioners in any of these areas who want to learn about another, because it provides a more concise and accessible treatment than other texts.The book can cover so wide a range of material because it focuses on ideas that arerelevant to the methods used in general-purpose optimization and constraint solvers. The book focuses on ideas behind the methods that have proved useful in general-purpose optimization and constraint solvers, as well as integrated solvers of the present and foreseeable future.  The second edition updates results in this area and includes several major new topics:Background material in linear, nonlinear, and dynamic programming.Network flow theory, due to its importance in filtering algorithms.A chapter on generalized duality theory that more explicitly develops a unifying primal-dual algorithmic structure for optimization methods.An extensive survey of search methods from both MP and AI, using the primal-dual framework as an organizing principle.Coverage of several additional global constraints used in CP solvers.The book continues to focus on exact as opposed to heuristic methods. It is possible to bring heuristic methods into the unifying scheme described in the book, and the new edition will retain the brief discussion of how this might be done.

The first edition of Integrated Methods for Optimization was published in January 2007. Because the book covers a rapidly developing field, the time is right for a second edition. The book provides a unified treatment of optimization methods. It brings ideas from mathematical programming (MP), constraint programming (CP), and global optimization (GO)into a single volume. There is no reason these must be learned as separate fields, as they normally are, and there are three reasons they should be studied together. (1) There is much in common among them intellectually, and to a large degree they can be understood as special cases of a single underlying solution technology. (2) A growing literature reports how they can be profitably integrated to formulate and solve a wide range of problems. (3) Several software packages now incorporate techniques from two or more of these fields.

The book provides a unique resource for graduate students and practitioners who want a well-rounded background in optimization methods within a single course of study. Engineering students are a particularly large potential audience, because engineering optimization problems often benefit from a combined approach—particularly where design, scheduling, or logistics are involved. The text is also of value to those studying operations research, because their educational programs rarely cover CP, and to those studying computer science and artificial intelligence (AI), because their curric

ula typically omit MP and GO. The text is also useful for practitioners in any of these areas who want to learn about another, because it provides a more concise and accessible treatment than other texts.

The book can cover so wide a range of material because it focuses on ideas that arerelevant to the methods used in general-purpose optimization and constraint solvers. The book focuses on ideas behind the methods that have proved useful in general-purpose optimization and constraint solvers, as well as integrated solvers of the present and foreseeable future.  The second edition updates results in this area and includes several major new topics:

Background material in linear, nonlinear, and dynamic programming.Network flow theory, due to its importance in filtering algorithms.A chapter on generalized duality theory that more explicitly develops a unifying primal-dual algorithmic structure for optimization methods.An extensive survey of search methods from both MP and AI, using the primal-dual framework as an organizing principle.Coverage of several additional global constraints used in CP solvers.

The book continues to focus on exact as opposed to heuristic methods. It is possible to bring heuristic methods into the unifying scheme described in the book, and the new edition will retain the brief discussion of how this might be done.

The first edition of Integrated Methods for Optimization was published in January 2007. Because the book covers a rapidly developing field, the time is right for a second edition. The book provides a unified treatment of optimization methods. It brings ideas from mathematical programming (MP), constraint programming (CP), and global optimization (GO)into a single volume. There is no reason these must be learned as separate fields, as they normally are, and there are three reasons they should be studied together. (1) There is much in common among them intellectually, and to a large degree they can be understood as special cases of a single underlying solution technology. (2) A growing literature reports how they can be profitably integrated to formulate and solve a wide range of problems. (3) Several software packages now incorporate techniques from two or more of these fields.The book provides a unique resource for graduate students and practitioners who want a well-rounded background in optimization methods within a single course of study. Engineering students are a particularly large potential audience, because engineering optimization problems often benefit from a combined approach—particularly where design, scheduling, or logistics are involved. The text is also of value to those studying operations research, because their educational programs rarely cover CP, and to those studying computer science and artificial intelligence (AI), because their curricula typically omit MP and GO. The text is also useful for practitioners in any of these areas who want to learn about another, because it provides a more concise and accessible treatment than other texts.The book can cover so wide a range of material because it focuses on ideas that arerelevant to the methods used in general-purpose optimization and constraint solvers. The book focuses on ideas behind the methods that have proved useful in general-purpose optimization and constraint solvers, as well as integrated solvers of the present and foreseeable future.  The second edition updates results in this area and includes several major new topics:Background material in linear, nonlinear, and dynamic programming.Network flow theory, due to its importance in filtering algorithms.A chapter on generalized duality theory that more explicitly develops a unifying primal-dual algorithmic structure for optimization methods.An extensive survey of search methods from both MP and AI, using the primal-dual framework as an organizing principle.Coverage of several additional global constraints used in CP solvers.The book continues to focus on exact as opposed to heuristic methods. It is possible to bring heuristic methods into the unifying scheme described in the book, and the new edition will retain the brief discussion of how this might be done.

This book maintains that ethics should be addressed with the same rigor and discipline that we bring to science and mathematics. While recognizing that normative ethics cannot be an empirical science, the book develops a deductive science of ethics inspired by the practices of working mathematicians. It treats traditional frameworks such as deontology and utilitarianism as proof techniques that can be used within a single deductive system. Applying this type of reasoning to a number of current ethical dilemmas, the book demonstrates how such an approach can make progress toward resolving controversial issues. Most of the book relies on careful analysis rather than mathematical notation, although two chapters present an explicitly mathematical treatment of distributive justice, reflecting the author’s unusual dual background in philosophy and applied mathematics.The book is of interest to ethicists, philosophers, and welfare economists engaged in ethics-related research, as well as practitioners who develop ethical policies in business, professional, or public policy contexts. Its rigorous treatment will also be valuable to technical specialists who incorporate ethics into mathematical models and artificial intelligence. The book is also suitable for postgraduate students in these areas.

This book constitutes the refereed proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2009, held in Pittsburgh, PA, USA, in May 2009. The 20 revised full papers and 10 extended abstracts presented together with 2 invited talks were carefully reviewed and selected from 65 submissions. The papers describe current research in the fields of constraint programming, artificial intelligence, and operations research and present new techniques or new applications in combinatorial optimization, thus exploring ways of solving large-scale, practical optimization problems through integration and hybridization of the fields' different techniques.