20 search results - page 2 / 4 » cpaior 2007 |
CPAIOR
2007
Springer
13 years 11 months ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
CPAIOR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. This article first introduces an extension of the classical cumulative constraint: each task is no more a rectangle but rather a sequence of contiguous trapezoid sub-tas...
CPAIOR
2007
Springer
13 years 11 months ago
2007
Springer
This paper introduces DEVIATION, a soft global constraint to obtain balanced solutions. A violation measure of the perfect balance can be defined as the Lp norm of the vector vari...
CPAIOR
2007
Springer
13 years 11 months ago
2007
Springer
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...
CPAIOR
2007
Springer
13 years 11 months ago
2007
Springer
One of the most important policies adopted in inventory control is the (R,S) policy (also known as the “replenishment cycle” policy). Under the non-stationary demand assumption...