Browsing Working Papers by Author "Sridharan, R."

Now showing items 1-6 of 6

    • Capacitated plant location problem some worst case analysis 

      Sridharan, R. (2010-07-27)
      In this note we show that the worst case solutions of the weak linear programming relaxation, the DRDP heuristic and the ADD heauristic for the Capacitated Plant Problem are not good.

    • A Lagrangian heuristic for the capacitated plant location problem with side constraints 

      Sridharan, R. (Indian Institute of Management Ahmedabad, 1989-09-01)
      In this paper we present a Lagrangian relaxation approach for solving the capacitated plant location problem with side constraints. The side constraints are upper bound constraints on disjoint subsets of the (0-1) variables. ...

    • The minimum weight rooted arborescence problem: weights on ARCS case 

      Rao, V. Venkata; Sridharan, R. (2010-03-24)
      In a rooted acyclic graph, G, there exits, in general, several rooted (not necessarily spanning) arborscences. Depending on whether the graph has weights on nodes, on arcs, or on both, it is possible to define, with different ...

    • Primal and Lagrangian heuristics for minimum weight rooted arborescence problem 

      Rao, V. Venkata; Sridharan, R. (2010-07-27)
      Consider a rooted acyclic graph G with weights on arcs. In this graph, a minimum weight rooted arborescence (MRC) can be defined as one whose sum of arc weights is less than or equal to that of any other rooted arborescence ...

    • Telecommunications: some social issues 

      Jain, Mukesh; Sridharan, R. (2010-07-20)
      In this paper we look at the technological developments in telecommunications over the years and their implications to the society in which we live. We realise that in this "Information Age" the World is only as far as the ...

    • Two stage heuristic for designing data communication networks 

      Sridharan, R.; Ravi, N. (2010-03-15)
      In this paper, we present a two-stage heuristic which identifies the most economical way to connect the nodes of a date communication network. We formulate this network design problem as a star-star concentrator location ...