scispace - formally typeset
Search or ask a question
Topic

Constraint programming

About: Constraint programming is a research topic. Over the lifetime, 8175 publications have been published within this topic receiving 190683 citations.


Papers
More filters
Book ChapterDOI
28 Aug 2017
TL;DR: An optimization application in the context of steel manufacturing, to design and schedule batches for annealing furnaces using a mixed-integer linear programming model and constraint programming is described.
Abstract: We describe an optimization application in the context of steel manufacturing, to design and schedule batches for annealing furnaces. Our solution approach uses a two-phase decomposition. The first phase groups together orders into batches using a mixed-integer linear programming model. The second phase assigns the batches to furnaces and schedules them over time, using constraint programming. Our solution has been developed for operational use in two plants of a steel manufacturer in North America.
01 Jan 2002
TL;DR: This position paper presents the constraint technology that has been developed 1 at THalES since 1997 for introducing Constraint Programming (CP) in THALES operational systems (see [Givry.al01a] for a longer presentation).
Abstract: This position paper presents the constraint technology that has been developed 1 at THALES since 1997 for introducing Constraint Programming (CP) in THALES operational systems (see [Givry.et.al01a] for a longer presentation). These systems involve combinatorial optimization problems such as planning and scheduling problems that can be expressed with finite-domain variables and constraints. Typical examples of THALES systems concern supervision, for weapon allocation, radar configuration, weapon deployment and aircraft sequencing. All these systems are subject to specific requirements coming from the operational constraints of embedded real-time systems and from the strategic context of Defense applications: • The system involves several functions/tasks such as situation assessment, resource management, visualization, etc.; each task is periodical and the period can be much shorter than a second; • There is a memory space limit (a few megabytes); • The system has to be supported for a long time, typically over 20 years for Defense applications, including several retrofitting (functional and platform evolutions); • The system can be reused and modified for building a specific system for a new client (product line);
Posted Content
TL;DR: In this paper, the authors show that the problem of finding a stable matching that maximises the number of first choices does not admit a constant time approximation algorithm and is W[1]-hard with respect to the first choices.
Abstract: The stable roommates problem can admit multiple different stable matchings. We have different criteria for deciding which one is optimal, but computing those is often NP-hard. We show that the problem of finding generous or rank-maximal stable matchings in an instance of the roommates problem with incomplete lists is NP-hard even when the preference lists are at most length 3. We show that just maximising the number of first choices or minimising the number of last choices is NP-hard with the short preference lists. We show that the number of $R^{th}$ choices, where $R$ is the minimum-regret of a given instance of SRI, is 2-approximable among all the stable matchings. Additionally, we show that the problem of finding a stable matching that maximises the number of first choices does not admit a constant time approximation algorithm and is W[1]-hard with respect to the number of first choices. We implement integer programming and constraint programming formulations for the optimality criteria of SRI. We find that constraint programming outperforms integer programming and an earlier answer set programming approach by Erdam et. al. (2020) for most optimality criteria. Integer programming outperforms constraint programming and answer set programming on the almost stable roommates problem.
Posted Content
TL;DR: This work investigates static FAP, where an attempt is first made to configure a kernel of links to integrate the site availability concept and study the problem based on the concepts and techniques of Constraint Programming.
Abstract: The efficient use of bandwidth for radio communications becomes more and more crucial when developing new information technologies and their applications. The core issues are addressed by the so-called Frequency Assignment Problems (FAP). Our work investigates static FAP, where an attempt is first made to configure a kernel of links. We study the problem based on the concepts and techniques of Constraint Programming and integrate the site availability concept. Numerical simulations conducted on scenarios provided by CELAR are very promising.
Journal Article
TL;DR: Comparison analysis on various types of models which can be used for both functional and non functional programming, including tradition-ally, static analysis and related tools is focused on.
Abstract: Software functional programming is a a style of building the structure and elements of computer programs, that treats computation as the evaluation of mathematical functions and avoids state and mutable data. Functional programming emphasizes functions that produce results that depend only on their inputs and not on the program state - i.e. pure mathematical functions. It is a declarative programming paradigm, which means programming is done with expressions. Analysis of functional and imperative programs has the potential to contribute to the control of quality of software. Internal attributes, such as structural properties, measured in the static analysis, are claimed to have a correlation with external at-tributes, such as comprehensibility, maintainability and testability. Tradition-ally, static analysis and related tools focuses mainly on programs written in imperative programming languages. This paper focuses on comparative analysis on various types of models which can be used for both functional and non functional programming.

Network Information
Related Topics (5)
Heuristics
32.1K papers, 956.5K citations
86% related
Graph (abstract data type)
69.9K papers, 1.2M citations
84% related
Metaheuristic
29.9K papers, 921K citations
84% related
Scheduling (computing)
78.6K papers, 1.3M citations
82% related
Genetic algorithm
67.5K papers, 1.2M citations
81% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202344
2022110
2021156
2020197
2019205
2018199