Skip to main content

3 Result(s)

within Prabha Sharma Remove this filter Management Remove this filter

and

  1. No Access

    Article

    Robust discrete spanning tree problem: local search algorithms

    In this paper the robust spanning tree problem and the relative robust spanning tree problem on an arbitrary graph, whose edge costs vary over a finite set, are considered. All possible combinations of the edg...

    Prabha Sharma, Sandeep Singh, Diptesh Ghosh, R Chandrasekaran in OPSEARCH (2022)

  2. No Access

    Article

    Symmetric weight constrained traveling salesman problem: local search

    Performance of 2-opt and 3-opt local search procedures for the weight constrained symmetric traveling salesman problem (WCTSP) on a complete graph have been estimated. For TSPLIB problems for which optimal sol...

    Dharmananda Gahir, Prabha Sharma in OPSEARCH (2010)

  3. No Access

    Article

    An efficient heuristic algorithm for the bottleneck traveling salesman problem

    This paper describes a new heuristic algorithm for the bottleneck traveling salesman problem (BTSP), which exploits the formulation of BTSP as a traveling salesman problem (TSP). Computational tests show that ...

    Ravi Ramakrishnan, Prabha Sharma, Abraham P. Punnen in OPSEARCH (2009)