Name
Title | ||
|---|---|---|
Using constraint techniques for a safe and fast implementation of optimality-based reduction |
Abstract | ||
|---|---|---|
Optimality-based reduction attempts to take advantage of the known bounds of the objective function to reduce the domain of the variables, and thus to speed up the search of a global optimum. However, the basic algorithm is unsafe, and thus, the overall process may no longer be complete and may not reach the actual global optimum. Recently, Kearfott has proposed a safe implementation of optimality-based reduction. Unfortunately, his method suffers from some limitations and is rather slow. In this paper, we show how constraint programming filtering techniques can be used to implement optimality-based reduction in a safe and efficient way. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1145/1244002.1244079 | SAC |
Keywords | Field | DocType |
basic algorithm,constraint programming,fast implementation,overall process,optimality-based reduction,safe implementation,objective function,optimality-based reduction attempt,constraint technique,known bound,global optimization | Mathematical optimization,Global optimization,Computer science,Constraint programming,Filter (signal processing),Global optimum,Reliable computing,Speedup | Conference |
ISBN | Citations | PageRank |
1-59593-480-4 | 1 | 0.34 |
References | Authors | |
12 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yahia Lebbah | 1 | 115 | 19.34 |
| Claude Michel | 2 | 107 | 10.57 |
| Michel Rueher | 3 | 613 | 59.81 |