The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Joy Bhadury: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Laxmi Gewali, Prashu Kodela, Joy Bhadury
    Approximation Algorithm for Multi-Facility Location. [Citation Graph (0, 0)][DBLP]
    Applied Informatics, 2003, pp:411-416 [Conf]
  2. Joy Bhadury, Ramaswamy Chandrasekaran, Laxmi Gewali
    Constructing median constrained minimum spanning tree. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  3. Joy Bhadury, Ramaswamy Chandrasekaran
    Finding the Set of All Minimal Nested Convex Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:26-31 [Conf]
  4. Laxmi Gewali, Joy Bhadury, Ramaswamy Chandrasekaran
    Network Design Subject to Facility Location. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:128-131 [Conf]
  5. Joy Bhadury, Horst A. Eiselt, Jorge H. Jaramillo
    An alternating heuristic for medianoid and centroid problems in the plane. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2003, v:30, n:4, pp:553-565 [Journal]
  6. Jorge H. Jaramillo, Joy Bhadury, Rajan Batta
    On the use of genetic algorithms to solve location problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2002, v:29, n:6, pp:761-779 [Journal]
  7. Joy Bhadury, V. Chandru, A. Maheshwari, Ramaswamy Chandrasekaran
    Art Gallery Problems for Convex Nested Polygons. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 1997, v:9, n:1, pp:100-110 [Journal]

  8. Risk management in uncapacitated facility location models with random demands. [Citation Graph (, )][DBLP]


Search in 0.142secs, Finished in 0.143secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002