Neighborhood search heuristics for the uncapacitated facility location problem D Ghosh European Journal of Operational Research 150 (1), 150-162, 2003 | 234 | 2003 |
Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods R Kothari, D Ghosh European Jounral of Operational Research, 2012 | 121 | 2012 |
Branch and peg algorithms for the simple plant location problem B Goldengorin, D Ghosh, G Sierksma Computers & Operations Research 30 (7), 967-981, 2003 | 104 | 2003 |
A scatter search algorithm for the single row facility layout problem R Kothari, D Ghosh Journal of Heuristics 20, 125-142, 2014 | 74 | 2014 |
An efficient genetic algorithm for single row facility layout R Kothari, D Ghosh Optimization Letters 8, 679-690, 2014 | 65 | 2014 |
The Single Row Facility Layout Problem: State of the Art R Kothari, D Ghosh Opsearch, 2012 | 62 | 2012 |
Tolerance-based Branch and Bound algorithms for the ATSP M Turkensteen, D Ghosh, B Goldengorin, G Sierksma European Journal of Operational Research 189 (3), 775-788, 2008 | 60 | 2008 |
International series in operations research and management science L Bianco, M Caramia, S Giordani, V Piccialli Springer, 2013 | 47* | 2013 |
Insertion based Lin-Kernighan heuristic for single row facility layout R Kothari, D Ghosh Computers & Operations Research 40 (1), 129-136, 2012 | 43 | 2012 |
Complete local search with memory D Ghosh, G Sierksma Journal of Heuristics 8, 571-584, 2002 | 40 | 2002 |
Solving the simple plant location problem using a data correcting approach B Goldengorin, GA Tijssen, D Ghosh, G Sierksma Journal of Global Optimization 25, 377-406, 2003 | 37 | 2003 |
Population heuristics for the corridor allocation problem D Ghosh, R Kothari | 30 | 2012 |
Data aggregation for p-median problems BF AlBdaiwi, D Ghosh, B Goldengorin Journal of combinatorial optimization 21, 348-363, 2011 | 29 | 2011 |
Networks in action G Sierksma, D Ghosh International Series in Operations Research and Management Science, 2010 | 27 | 2010 |
Solving medium to large sized Euclidean generalized minimum spanning tree problems D Ghosh | 23 | 2003 |
A competitive local search heuristic for the subset sum problem D Ghosh, N Chakravarti Computers and Operations Research 26 (3), 271-280, 1999 | 21 | 1999 |
Sensitivity analysis of a greedy heuristic for knapsack problems D Ghosh, N Chakravarti, G Sierksma European Journal of Operational Research 169 (1), 340-350, 2006 | 20 | 2006 |
A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem B Goldengorin, D Ghosh Journal of Global Optimization 32, 65-82, 2005 | 19 | 2005 |
Binary knapsack problems with random budgets S Das, D Ghosh Journal of the Operational Research Society 54 (9), 970-983, 2003 | 16 | 2003 |
Emergence of distributed coordination in the Kolkata paise restaurant problem with finite information D Ghosh, AS Chakrabarti Physica A: Statistical Mechanics and its Applications 483, 16-24, 2017 | 13 | 2017 |