Joy Bhadury

12 papers Journal 7Unranked 5
YearRankTypeTitle / Venue / Authors
2013 J jnl
An optimization-based framework for modelling counter-terrorism strategies.
OR Insight
Horst A. Eiselt, Joy Bhadury, Mark L. Burkey
2010 J jnl
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.
Joy Bhadury, Craig A. Tovey
2009 — conf
Optimization Model For Distributed Routing For Disaster Area Logistics.
SOLI
Mojahid F. Saeed Osman, Bala Ram, Joy Bhadury, Paul Stanfield, Lauren B. Davis, Funda Samanlioglu
2009 J jnl
Risk management in uncapacitated facility location models with random demands.
Comput. Oper. Res.
Michael R. Wagner, Joy Bhadury, Steve Peng
2003 J jnl
An alternating heuristic for medianoid and centroid problems in the plane.
Comput. Oper. Res.
Joy Bhadury, Horst A. Eiselt, Jorge H. Jaramillo
2003 — conf
Approximation Algorithm for Multi-Facility Location.
Applied Informatics
Laxmi P. Gewali, Prashu Kodela, Joy Bhadury
2003 — conf
Network Design Subject to Facility Location.
CCCG
Laxmi P. Gewali, Joy Bhadury, Ramaswamy Chandrasekaran
2002 J jnl
On the use of genetic algorithms to solve location problems.
Comput. Oper. Res.
Jorge H. Jaramillo, Joy Bhadury, Rajan Batta
1999 J jnl
Brand positioning under lexicographic choice rules.
Eur. J. Oper. Res.
Joy Bhadury, Horst A. Eiselt
1998 — conf
Constructing median constrained minimum spanning tree.
CCCG
Joy Bhadury, Ramaswamy Chandrasekaran, Laxmi P. Gewali
1997 J jnl
Art Gallery Problems for Convex Nested Polygons.
INFORMS J. Comput.
Joy Bhadury, V. Chandru, A. Maheshwari, Ramaswamy Chandrasekaran
1996 — conf
Finding the Set of All Minimal Nested Convex Polygons.
CCCG
Joy Bhadury, Ramaswamy Chandrasekaran