Sciweavers

Share
ENDM
2010
110views more  ENDM 2010»
8 years 6 months ago
Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs
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...
Ivana Ljubic, Stefan Gollowitzer
ENDM
2010
81views more  ENDM 2010»
8 years 6 months ago
Mixed Integer NonLinear Programs featuring "On/Off" constraints: convex analysis and applications
We call "on/off" constraint an algebraic constraint that is activated if and only if
Hassan Hijazi, Pierre Bonami, Gérard Cornu&...
ENDM
2010
65views more  ENDM 2010»
8 years 6 months ago
Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling
Maria Ayala, Christian Artigues, Bernat Gacias
ENDM
2010
136views more  ENDM 2010»
8 years 6 months ago
Approximating the asymmetric profitable tour
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...
Viet Hung Nguyen, Thi Thu Thuy Nguyen
ENDM
2010
72views more  ENDM 2010»
8 years 6 months ago
The sandwich line graph
Denis Cornaz, Philippe Meurdesoif
ENDM
2010
141views more  ENDM 2010»
8 years 6 months ago
Solving Replica Placement and Request Distribution in Content Distribution Networks
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...
Tiago Araújo Neves, Lúcia Maria de A...
ENDM
2010
87views more  ENDM 2010»
8 years 6 months ago
Euler Complexes (Oiks)
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...
Jack Edmonds
ENDM
2010
100views more  ENDM 2010»
8 years 6 months ago
Large-scale multi-period precedence constrained knapsack problem: A mining application
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...
Eduardo Moreno, Daniel G. Espinoza, Marcos Goycool...
ENDM
2010
105views more  ENDM 2010»
8 years 6 months ago
Minimizing Expected Attacking Cost in Networks
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...
Anis Gharbi, Mohamed Naceur Azaiez, Mohamed Kharbe...
books