Journal Article10.1016/S0377-2217(98)00364-6
Constraint satisfaction problems: Algorithms and applications
TL;DR: The aim of this paper is to introduce constraint statisfaction to the operational researchers.
read more
About: This article is published in European Journal of Operational Research. The article was published on 16 Dec 1999. The article focuses on the topics: Constraint satisfaction problem & Constraint satisfaction dual problem.
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
Recent research directions in automated timetabling
Edmund K. Burke,Sanja Petrovic +1 more
TL;DR: Some recent approaches to timetabling problems that have been developed or are under development in the Automated Scheduling, Optimisation and Planning Research Group (ASAP) at the University of Nottingham are introduced.
484
Sequencing mixed-model assembly lines: Survey, classification and model critique
TL;DR: This paper reviews and discusses the three major planning approaches presented in the literature, mixed-model sequencing, car sequencing and level scheduling, and provides a hierarchical classification scheme to systematically record the academic efforts in each field and to deduce future research issues.
476
A Comprehensive Review on NSGA-II for Multi-Objective Combinatorial Optimization Problems
TL;DR: In this article, the authors provide an extensive review of NSGA-II for selected combinatorial optimization problems viz. assignment problem, allocation problem, travelling salesman problem, vehicle routing problem, scheduling problem, and knapsack problem.
Laps Care—an operational system for staff planning of home care
TL;DR: The health care system in Sweden and many other countries is facing increasing costs, the major reason is the changing age distribution of the population with more elderly people in need of support.
393
From decision theory to decision aiding methodology
TL;DR: The author’s partial and personal historical reconstruction of how decision theory is evolving to a decision aiding methodology is presented, showing mainly how “alternative” approaches to classic decision theory evolved.
252
References
Reducibility Among Combinatorial Problems.
Richard M. Karp
- 01 Jan 1972
TL;DR: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
13.6K
Consistency in Networks of Relations
TL;DR: The primary aim is to provide an accessible, unified framework, within which to present the algorithms including a new path consistency algorithm, to discuss their relationships and the may applications, both realized and potential of network consistency algorithms.
2.8K
•Book
Local Search in Combinatorial Optimization
Emile H. L. Aarts,Jan Karel Lenstra +1 more
- 01 Apr 1997
TL;DR: Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in a reasonable time.
CHAPTER 10 – Logic Programming
Krzysztof R. Apt
- 01 Jan 1990
TL;DR: This chapter presents a self-contained introduction to the theory of logic programming, which discusses the causal dependence between various concepts and notions and presents the notion of SLD-resolution, which is central to the subject of logic Programming.
1.6K