Constraint satisfaction using constraint logic programming

From MaRDI portal
Publication:1204868

DOI10.1016/0004-3702(92)90006-JzbMath0782.68028OpenAlexW2030522691MaRDI QIDQ1204868

Mehmet Dincbas, Helmut Simonis, Pascal Van Hentenryck

Publication date: 1 April 1993

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(92)90006-j



Related Items

A GRASP approach for the extended car sequencing problem, Computing leximin-optimal solutions in constraint networks, Model-based inference in CHARME., Metaheuristics: A bibliography, A new generic scheme for functional logic programming with constraints, Avoiding slack variables in the solving of linear diophantine equations and inequations, Solving linear, min and max constraint systems using CLP based on relational interval arithmetic, Maximum feasibility estimation, Weight-based heuristics for constraint satisfaction and combinatorial optimization problems, The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem, Branching and pruning: An optimal temporal POCL planner based on constraint programming, A beam search approach for the optimization version of the car sequencing problem, On the complexity of the car sequencing problem., Planning as heuristic search, Planning and control in artificial intelligence: A unifying perspective, Advanced constraint propagation for the combined car sequencing and level scheduling problem, Bucket elimination for multiobjective optimization problems, A Lagrangian-ACO matheuristic for car sequencing, Constraint satisfaction problems: Algorithms and applications, A parametric filtering algorithm for the graph isomorphism problem, Timetable planning using the constraint-based reasoning, Constraint propagation techniques for the disjunctive scheduling problem, An efficient bounds consistency algorithm for the global cardinality constraint


Uses Software


Cites Work