Diptesh Ghosh

21 papers Journal 20Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
SITS: an efficient tabu search algorithm for the tool indexing problem without tool duplication.
Int. J. Prod. Res.
Deepti Mohan, Diptesh Ghosh
2017 J jnl
Emergence of Distributed Coordination in the Kolkata Paise Restaurant Problem with Finite Information.
CoRR
Diptesh Ghosh, Anindya S. Chakrabarti
2016 J jnl
Improving Server Utilization in a Distributed Computing Set-up with Independent Clients.
CoRR
Anindya S. Chakrabarti, Diptesh Ghosh
2014 J jnl
A scatter search algorithm for the single row facility layout problem.
J. Heuristics
Ravi Kothari, Diptesh Ghosh
2014 J jnl
An efficient genetic algorithm for single row facility layout.
Optim. Lett.
Ravi Kothari, Diptesh Ghosh
2013 J jnl
Insertion based Lin-Kernighan heuristic for single row facility layout.
Comput. Oper. Res.
Ravi Kothari, Diptesh Ghosh
2013 J jnl
Speeding Up the Estimation of the Expected Value of Maximum Flow Through Reliable Networks.
IEEE Trans. Reliab.
Megha Sharma, Diptesh Ghosh
2013 J jnl
Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods.
Eur. J. Oper. Res.
Ravi Kothari, Diptesh Ghosh
2011 J jnl
Data aggregation for
J. Comb. Optim.
Bader F. AlBdaiwi, Diptesh Ghosh, Boris Goldengorin
2008 J jnl
Tolerance-based Branch and Bound algorithms for the ATSP.
Eur. J. Oper. Res.
Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma
2006 J jnl
Iterative patching and the asymmetric traveling salesman problem.
Discret. Optim.
Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma
2006 J jnl
Sensitivity analysis of a greedy heuristic for knapsack problems.
Eur. J. Oper. Res.
Diptesh Ghosh, Nilotpal Chakravarti, Gerard Sierksma
2005 J jnl
A Multilevel Search Algorithm for the Maximization of Submodular Functions Applied to the Quadratic Cost Partition Problem.
J. Glob. Optim.
Boris Goldengorin, Diptesh Ghosh
2004 J jnl
Branch and peg algorithms for the simple plant location problem.
Comput. Oper. Res.
Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
2003 J jnl
Binary knapsack problems with random budgets.
J. Oper. Res. Soc.
Shubhabrata Das, Diptesh Ghosh
2003 J jnl
Branch and peg algorithms for the simple plant location problem.
Comput. Oper. Res.
Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
2003 J jnl
Neighborhood search heuristics for the uncapacitated facility location problem.
Eur. J. Oper. Res.
Diptesh Ghosh
2003 J jnl
Solving the Simple Plant Location Problem using a Data Correcting Approach.
J. Glob. Optim.
Boris Goldengorin, Gert A. Tijssen, Diptesh Ghosh, Gerard Sierksma
2002 J jnl
Complete Local Search with Memory.
J. Heuristics
Diptesh Ghosh, Gerard Sierksma
2001 — conf
Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem.
WAE
Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
1999 J jnl
A competitive local search heuristic for the subset sum problem.
Comput. Oper. Res.
Diptesh Ghosh, Nilotpal Chakravarti