2978 search results - page 193 / 596 » Operations Research |
102
Voted
CPAIOR
2007
Springer
15 years 10 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...
112
Voted
CPAIOR
2007
Springer
15 years 10 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...
114
Voted
CPAIOR
2007
Springer
15 years 10 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...
124
Voted
CPAIOR
2007
Springer
15 years 10 months ago
2007
Springer
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its mor...
118
Voted
CPAIOR
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...