2978 search results - page 118 / 596 » Operations Research |
178
click to vote
CPAIOR
2007
Springer
16 years 15 days ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
151
click to vote
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
Interval coefficients have been introduced in OR and CP to specify uncertain data in order to provide reliable solutions to convex models. The output is generally a solution set, ...
159
click to vote
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
In this paper, we present a constraint programming approach for the service consolidation problem that is being currently tackled by Neptuny, Milan. The problem is defined as: Giv...
146
click to vote
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
173
click to vote
CPAIOR
2004
Springer
15 years 10 months ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...