Diptesh Ghosh

Publication Activity (10 Years)

Years Active: 1999-2017
Publications (10 Years): 2

Top Topics

Facility Layout

Genetic Algorithm

Traveling Salesman Problem

Top Venues

IEEE Trans. Reliab.

Comput. Oper. Res.

Publications

Diptesh Ghosh, Anindya S. Chakrabarti
Emergence of Distributed Coordination in the Kolkata Paise Restaurant Problem with Finite Information. CoRR (2017)
Anindya S. Chakrabarti, Diptesh Ghosh
Improving Server Utilization in a Distributed Computing Set-up with Independent Clients. CoRR (2016)
Ravi Kothari, Diptesh Ghosh
An efficient genetic algorithm for single row facility layout. Optim. Lett. 8 (2) (2014)
Ravi Kothari, Diptesh Ghosh
A scatter search algorithm for the single row facility layout problem. J. Heuristics 20 (2) (2014)
Ravi Kothari, Diptesh Ghosh
Insertion based Lin-Kernighan heuristic for single row facility layout. Comput. Oper. Res. 40 (1) (2013)
Megha Sharma, Diptesh Ghosh
Speeding Up the Estimation of the Expected Value of Maximum Flow Through Reliable Networks. IEEE Trans. Reliab. 62 (1) (2013)
Ravi Kothari, Diptesh Ghosh
Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods. Eur. J. Oper. Res. 224 (1) (2013)
Bader F. AlBdaiwi, Diptesh Ghosh, Boris Goldengorin
-median problems. J. Comb. Optim. 21 (3) (2011)
Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma
Tolerance-based Branch and Bound algorithms for the ATSP. Eur. J. Oper. Res. 189 (3) (2008)
Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma
Iterative patching and the asymmetric traveling salesman problem. Discret. Optim. 3 (1) (2006)
Diptesh Ghosh, Nilotpal Chakravarti, Gerard Sierksma
Sensitivity analysis of a greedy heuristic for knapsack problems. Eur. J. Oper. Res. 169 (1) (2006)
Boris Goldengorin, Diptesh Ghosh
A Multilevel Search Algorithm for the Maximization of Submodular Functions Applied to the Quadratic Cost Partition Problem. J. Glob. Optim. 32 (1) (2005)
Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
Branch and peg algorithms for the simple plant location problem. Comput. Oper. Res. 31 (2) (2004)
Diptesh Ghosh
Neighborhood search heuristics for the uncapacitated facility location problem. Eur. J. Oper. Res. 150 (1) (2003)
Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
Branch and peg algorithms for the simple plant location problem. Comput. Oper. Res. 30 (7) (2003)
Shubhabrata Das, Diptesh Ghosh
Binary knapsack problems with random budgets. J. Oper. Res. Soc. 54 (9) (2003)
Boris Goldengorin, Gert A. Tijssen, Diptesh Ghosh, Gerard Sierksma
Solving the Simple Plant Location Problem using a Data Correcting Approach. J. Glob. Optim. 25 (4) (2003)
Diptesh Ghosh, Gerard Sierksma
Complete Local Search with Memory. J. Heuristics 8 (6) (2002)
Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem. WAE (2001)
Diptesh Ghosh, Nilotpal Chakravarti
A competitive local search heuristic for the subset sum problem. Comput. Oper. Res. 26 (3) (1999)