2   Artículos

 
en línea
Rakesh Kawatra    
We present an integer programming formulation of the min-sum arborescence with node outage costs problem. The solution to the problem consists of selecting links to connect a set of terminal nodes to a root node with minimal expected annual cost, where t... ver más
Revista: Review of Business Information Systems (RBIS)    Formato: Electrónico

 
en línea
Rakesh Kawatra    
In this paper we present a new heuristic procedure to solve the degree constrained minimal spanning tree problem. This procedure uses Lagrangian relaxation of the integer programming formulation of the problem to get a lower bound for the optimal objecti... ver más
Revista: Review of Business Information Systems (RBIS)    Formato: Electrónico

« Anterior     Página: 1 de 1     Siguiente »