Joy Bhadury

According to our database1, Joy Bhadury authored at least 12 papers between 1996 and 2013.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
An optimization-based framework for modelling counter-terrorism strategies.
OR Insight, 2013

2010
An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon.
Int. J. Comput. Math., 2010

2009
Risk management in uncapacitated facility location models with random demands.
Comput. Oper. Res., 2009

Optimization Model For Distributed Routing For Disaster Area Logistics.
Proceedings of the 2009 IEEE/INFORMS International Conference on Service Operations, 2009

2003
An alternating heuristic for medianoid and centroid problems in the plane.
Comput. Oper. Res., 2003

Network Design Subject to Facility Location.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

Approximation Algorithm for Multi-Facility Location.
Proceedings of the 21st IASTED International Multi-Conference on Applied Informatics (AI 2003), 2003

2002
On the use of genetic algorithms to solve location problems.
Comput. Oper. Res., 2002

1999
Brand positioning under lexicographic choice rules.
Eur. J. Oper. Res., 1999

1998
Constructing median constrained minimum spanning tree.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Art Gallery Problems for Convex Nested Polygons.
INFORMS J. Comput., 1997

1996
Finding the Set of All Minimal Nested Convex Polygons.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996


  Loading...