Sciweavers

314 search results - page 11 / 63
» A non-binary constraint ordering heuristic for constraint sa...
Sort
View
CP
2003
Springer
14 years 26 days ago
Redundant Modeling for the QuasiGroup Completion Problem
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
Iván Dotú, Alvaro del Val, Manuel Ce...
AIPS
2007
13 years 10 months ago
Managing Personal Tasks with Time Constraints and Preferences
This paper treats the problem of managing personal tasks, through an adaptation of the Squeaky Wheel Optimization (SWO) framework, enhanced with powerful heuristics and full const...
Ioannis Refanidis
CONSTRAINTS
2006
105views more  CONSTRAINTS 2006»
13 years 7 months ago
Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, s...
Y. Law, J. Lee
HEURISTICS
2002
146views more  HEURISTICS 2002»
13 years 7 months ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
CORR
2011
Springer
160views Education» more  CORR 2011»
12 years 11 months ago
Compositional Model Repositories via Dynamic Constraint Satisfaction with Order-of-Magnitude Preferences
The predominant knowledge-based approach to automated model construction, compositional modelling, employs a set of models of particular functional components. Its inference mecha...
Jeroen Keppens, Qiang Shen