2978 search results - page 342 / 596 » Operations Research |
122
click to vote
CPAIOR
2004
Springer
15 years 9 months ago
2004
Springer
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
122
click to vote
CPAIOR
2004
Springer
15 years 9 months ago
2004
Springer
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
115
click to vote
CP
2003
Springer
15 years 9 months ago
2003
Springer
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...
160
click to vote
HICSS
2000
IEEE
15 years 8 months ago
2000
IEEE
Most major airlines decide to take new strategies for the competition in the air cargo industry. They are concerned with assigning cargo over flights in creative ways. This paper ...
141
click to vote
CPM
2000
Springer
15 years 8 months ago
2000
Springer
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...