Finding the Set of All Minimal Nested Convex Polygons. - Joy Bhadury; Ramaswamy Chandrasekaran (CCCG, 1996)

Art Gallery Problems for Convex Nested Polygons. - Joy Bhadury; V. Chandru; A. Maheshwari; Ramaswamy Chandrasekaran (INFORMS J. Comput., 1997)

Constructing median constrained minimum spanning tree. - Joy Bhadury; Ramaswamy Chandrasekaran; Laxmi P. Gewali (CCCG, 1998)

Brand positioning under lexicographic choice rules. - Joy Bhadury; Horst A. Eiselt (Eur. J. Oper. Res., 1999)

On the use of genetic algorithms to solve location problems. - Jorge H. Jaramillo; Joy Bhadury; Rajan Batta (Comput. Oper. Res., 2002)

Approximation Algorithm for Multi-Facility Location. - Laxmi P. Gewali; Prashu Kodela; Joy Bhadury (Applied Informatics, 2003)

Network Design Subject to Facility Location. - Laxmi P. Gewali; Joy Bhadury; Ramaswamy Chandrasekaran (CCCG, 2003)

An alternating heuristic for medianoid and centroid problems in the plane. - Joy Bhadury; Horst A. Eiselt; Jorge H. Jaramillo (Comput. Oper. Res., 2003)

Optimization Model For Distributed Routing For Disaster Area Logistics. - Mojahid F. Saeed Osman; Bala Ram; Joy Bhadury; Paul Stanfield; Lauren B. Davis; Funda Samanlioglu (SOLI, 2009)

Risk management in uncapacitated facility location models with random demands. - Michael R. Wagner; Joy Bhadury; Steve Peng (Comput. Oper. Res., 2009)

An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon. - Joy Bhadury; Craig A. Tovey (Int. J. Comput. Math., 2010)

An optimization-based framework for modelling counter-terrorism strategies. - Horst A. Eiselt; Joy Bhadury; Mark L. Burkey (OR Insight, 2013)