Sciweavers

721 search results - page 1 / 145
» GRASP - evolution for constraint satisfaction problems
Sort
View
AISS
2010
161views more  AISS 2010»
13 years 4 months ago
Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
Joseph Gallart Suarez, Manuel Tupia Anticona
CONSTRAINTS
2007
120views more  CONSTRAINTS 2007»
13 years 7 months ago
Automatic Generation of Redundant Models for Permutation Constraint Satisfaction Problems
Yat Chiu Law, Jimmy Ho-Man Lee, Barbara M. Smith
AAAI
2012
11 years 9 months ago
A Dichotomy for 2-Constraint Forbidden CSP Patterns
Novel tractable classes of the binary CSP (constraint satisfaction problem) have recently been discovered by studying classes of instances defined by excluding subproblems descri...
Martin C. Cooper, Guillaume Escamocher
AMC
2008
106views more  AMC 2008»
13 years 7 months ago
A non-binary constraint ordering heuristic for constraint satisfaction problems
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
Miguel A. Salido
IJCAI
1993
13 years 8 months ago
Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
Eugene C. Freuder, Paul D. Hubbe