Journal Article10.1287/IJOC.14.4.295.2828
Logic, Optimization, and Constraint Programming
181
TL;DR: This paper summarizes and contrasts the characteristics of the two fields; in particular, how they use logical inference in different ways, and how they can be combined.
read more
Abstract: Because of their complementary strengths, optimization and constraint programming can be profitably merged. Their integration has been the subject of increasing commercial and research activity. This paper summarizes and contrasts the characteristics of the two fields; in particular, how they use logical inference in different ways, and how these ways can be combined. It sketches the intellectual background for recent efforts at integration. It traces the history of logic-based methods in optimization and the development of constraint programming in artificial intelligence. It concludes with a review of recent research, with emphasis on schemes for integration, relaxation methods, and practical applications.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Integer and Combinatorial Optimization
Karla Hoffman,Ted K. Ralphs +1 more
- 01 Jan 2013
TL;DR: In today’s changing and competitive industrial environment, the difference between ad hoc planning methods and those that use sophisticated mathematical models to determine an optimal course of action can determine whether or not a company survives.
Enterprise‐wide optimization: A new frontier in process systems engineering
TL;DR: In this article, the authors present a new emerging area that lies at the interface of chemical engineering and operations research, and has become a major goal in the process industries due to the increasing pressures for remaining competitive in the global marketplace.
Complete search in continuous global optimization and constraint satisfaction
TL;DR: This survey covers the state of the art of techniques for solving general-purpose constrained global optimization problems and continuous constraint satisfaction problems, with emphasis on complete techniques that provably find all solutions (if there are finitely many).
Scheduling projects with multi-skilled personnel by a hybrid MILP/CP benders decomposition algorithm
Haitao Li,Keith Womer +1 more
TL;DR: A hybrid Benders decomposition (HBD) algorithm is developed that combines the complimentary strengths of both mixed-integer linear programming (MILP) and constraint programming (CP) to solve this NP-hard optimization problem.
References
•Book
Integer programming
George L. Nemhauser,Laurence A. Wolsey +1 more
- 01 Jan 1972
TL;DR: The principles of integer programming are directed toward finding solutions to problems from the fields of economic planning, engineering design, and combinatorial optimization as mentioned in this paper, which is a standard of graduate-level courses since 1972.
4.6K
•Book
Foundations of logic programming
John W. Lloyd
- 01 Jan 1984
TL;DR: This is the second edition of an account of the mathematical foundations of logic programming, which collects, in a unified and comprehensive manner, the basic theoretical results of the field, which have previously only been available in widely scattered research papers.
4.5K
Local computations with probabilities on graphical structures and their application to expert systems
TL;DR: The invention comprises pigments of the general Formula I in which each X is hydrogen, chlorine or bromine, A is (a) an aliphatic hydrocarbon radical, (b) the phenylene group or (c) the naphthylene group and R is identical with the 1: 2-phthaloylcarbazole-aminocarbonyl radical shown in the formula.
4.3K
Related Papers (5)
George L. Nemhauser,Laurence A. Wolsey +1 more
- 01 Jan 1988
[...]
George L. Nemhauser,Laurence A. Wolsey +1 more
- 01 Jan 1972
John N. Hooker,G. Ottosson +1 more