Constraints
Publisher: Springer Nature · ISSN 1383-7133,1572-9354 · 31 articles
-
Approximating Pareto frontiers in stochastic multi-objective optimization via hashing and randomization
Abstract Stochastic Multi-Objective Optimization (SMOO) is critical for decision-making that trades off multiple potentially conflicting objectives in uncertain environments. SMOO aims to identify the Pareto frontier, which contains all...
-
Optimizing multiple-control Toffoli quantum circuit design with constraint programming
Abstract As quantum technology advances, the efficient design of quantum circuits has become an important area of research. This paper provides an introduction to the MCT quantum circuit design problem for reversible Boolean functions...
- Introduction to the Constraints journal Thirtieth Anniversary special issue
- A cost-regular based hybrid column generation approach: a commentary
-
The legacy of the Zinc modelling language
Abstract The Zinc modelling language was developed as part of the G12 project, which aimed to generate a new approach to constraint programming. A key feature of Zinc was its solver-independence, deliberately designed to separate the...
- Commentary on paper: ”Learning the travelling salesperson problem requires rethinking generalization”
- Markov constraints revisited: commentary on “Markov constraints: steerable generation of Markov sequences”
- Probe backtrack search, revisited
- Radio link frequency assignment revisited
-
Practical applications of constraint programming: retrospective
Abstract This article is a retrospective look at practical applications of constraint programming following up on the original article published in 1996.
-
Reflections on Essence: a constraint language for specifying combinatorial problems
Abstract Essence is a constraint language for specifying combinatorial problems. It is designed to be significantly more abstract than constraint modelling languages currently in use. The first full description of the language and its...
- Commentary on “Musical harmonization with constraints: a survey”
- The global constraint catalogue: a retrospective on organic growth and unplanned emergence
-
Comments on “Constraint models for the covering test problem”
Abstract Earlier versions of this work were presented at workshops in 2004–5 and the final version was published in the Constraints journal in 2006. In our paper we applied CP and SAT methods to the problem of finding covering arrays,...
-
Commentary on “Cardinality Networks: a theoretical and empirical study”
Abstract In this invited retrospective, we reflect on the background, development and legacy of our paper “Cardinality Networks: a theoretical and empirical study” [1]. We revisit the historical context of cardinality and pseudo-Boolean...
- Automatically configuring constraint satisfaction programs: a retrospective
- Conditional temporal planning: how chance encounters and casual collaborations may raise great expectations
-
Lazy clause generation in retrospect
Abstract Lazy clause generation (LCG) is an approach to building constraint programming (CP) solvers that uses ideas from Boolean Satisfiability (SAT) solvers. Propagation in the CP solver is extended to explain itself, lazily creating...
- Utilizing simple tabular reduction wisely
- Semiring–based and valued CSPs revisited
- Constraint-based attribute and interval planning: a commentary
- Revisited: solving hard qualitative temporal reasoning problems
- Evaluating new methods for improving performance of algorithms for enumerating maximally feasible and minimally infeasible sets of constraints
- Preimage attacks on round-reduced MD5, SHA-1, and SHA-256 using parameterized SAT solver
- Solving logic-based benders decomposition master problems with constraint programming and domain-independent dynamic programming
-
MiniZinc with objects
Abstract Object-oriented programming is the dominant paradigm for general-purpose programming languages. While several attempts have been made to introduce object models into constraint modelling languages, these often have restrictions...
-
Solutions and minimal conflict search for product configuration: a case study
Abstract We consider a product configuration problem for high-performance pumps and valves, where feasible configurations are defined by restriction tables. For this problem we propose a Constraint Programming based model to find...
-
Word equations in synergy with regular constraints (extended version)
Abstract We propose a new automata-based algorithm for solving string constraints that tightly integrates reasoning about equations and regular constraints. Exchanging information between the two allows an efficient pruning of generated...
- Invariant polydiagonal subspaces of matrices and constraint programming
- Ner4Opt: named entity recognition for optimization modelling from natural language