ENDM
2010
14 years 15 days ago
2010
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
ENDM
2010
14 years 15 days ago
2010
We call "on/off" constraint an algebraic constraint that is activated if and only if
ENDM
2010
14 years 15 days ago
2010
ENDM
2010
14 years 15 days ago
2010
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
ENDM
2010
14 years 15 days ago
2010
ENDM
2010
14 years 15 days ago
2010
A Content Distribution Network (CDN) is an overlay network where servers replicate contents and distribute client's requests with the aim at reducing delay, server load and n...
ENDM
2010
14 years 15 days ago
2010
We present a class of instances of the existence of a second object of a specified type, in fact, of an even number of objects of a specified type, which generalizes the existence...
ENDM
2010
14 years 15 days ago
2010
We study an extension of the precedence constrained knapsack problem where the knapsack can be filled in multiple periods. This problem is known in the mining industry as the open...
ENDM
2010
14 years 15 days ago
2010
A branch-and-bound algorithm is devised to determine the optimal attack strategy to disconnect a network where the objective is to minimize the expected attacking cost. The attack...
ENDM
2010
14 years 15 days ago
2010
