186
Voted
CPAIOR
2010
Springer
16 years 20 days ago
2010
Springer
This paper introduces the Increasing Nvalue constraint, which restricts the number of distinct values assigned to a sequence of variables so that each variable in the sequence is l...
192
Voted
CPAIOR
2010
Springer
16 years 20 days 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...
191
click to vote
CPAIOR
2010
Springer
16 years 20 days 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...
212
Voted
CPAIOR
2010
Springer
16 years 20 days ago
2010
Springer
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
150
Voted
CPAIOR
2010
Springer
16 years 20 days ago
2010
Springer
261
Voted
CPAIOR
2010
Springer
16 years 20 days ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
140
Voted
CPAIOR
2010
Springer
16 years 20 days ago
2010
Springer
159
Voted
CPAIOR
2010
Springer
16 years 20 days ago
2010
Springer
