2109 search results - page 16 / 422 » Solving Necklace Constraint Problems |
151
click to vote
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
This paper presents a set of techniques that makes constraint programming a technique of choice for solving small (up to 30 nodes) traveling salesman problems. These techniques in...
139
click to vote
ECAIW
2000
Springer
15 years 10 months ago
2000
Springer
In this paper we present a tabu approach for a version of the Sports League Scheduling Problem. The approach adopted is based on a formulation of the problem as a Constraint Satisf...
148
click to vote
IEAAIE
2001
Springer
15 years 10 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
135
click to vote
CP
2007
Springer
16 years 1 days ago
2007
Springer
Salinity is the relative concentration of salts in water. In a city of southern China, the local water supply company pumps water from a nearby river for potable use. During the wi...
156
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ...