551 search results - page 28 / 111 » Continuous Search in Constraint Programming |
IJCAI
1989
13 years 10 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
EUROGP
2010
Springer
14 years 4 days ago
2010
Springer
Abstract. Geometric Differential Evolution (GDE) is a very recently introduced formal generalization of traditional Differential Evolution (DE) that can be used to derive specific ...
LOPSTR
2009
Springer
14 years 1 months ago
2009
Springer
In this paper, we propose an approach for automated test case generation based on techniques from constraint programming (CP). We advocate the use of standard CP search strategies ...
BIRTHDAY
2003
Springer
14 years 2 months ago
2003
Springer
Combinatorial optimization problems naturally arise in many application areas, including logistics, manufacturing, supplychain management, and resource allocation. They often give...
IPL
2007
13 years 8 months ago
2007
We study a model that incorporates a budget constraint in a decision making problem. Our goal is to maximize the expected wealth, where in each time period we can either stop the ...