Diptesh Ghosh

According to our database, Diptesh Ghosh authored at least 20 papers between 1999 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

SITS: an efficient tabu search algorithm for the tool indexing problem without tool duplication.

Deepti Mohan, Diptesh Ghosh

Int. J. Prod. Res., 2025

2017

Emergence of Distributed Coordination in the Kolkata Paise Restaurant Problem with Finite Information.

Diptesh Ghosh, Anindya S. Chakrabarti

CoRR, 2017

2016

Improving Server Utilization in a Distributed Computing Set-up with Independent Clients.

Anindya S. Chakrabarti, Diptesh Ghosh

CoRR, 2016

2014

An efficient genetic algorithm for single row facility layout.

Ravi Kothari, Diptesh Ghosh

Optim. Lett., 2014

A scatter search algorithm for the single row facility layout problem.

Ravi Kothari, Diptesh Ghosh

J. Heuristics, 2014

2013

Speeding Up the Estimation of the Expected Value of Maximum Flow Through Reliable Networks.

Megha Sharma, Diptesh Ghosh

IEEE Trans. Reliab., 2013

Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods.

Ravi Kothari, Diptesh Ghosh

Eur. J. Oper. Res., 2013

Insertion based Lin-Kernighan heuristic for single row facility layout.

Ravi Kothari, Diptesh Ghosh

Comput. Oper. Res., 2013

2011

Data aggregation for <i>p</i>-median problems.

Bader F. AlBdaiwi, Diptesh Ghosh, Boris Goldengorin

J. Comb. Optim., 2011

2008

Tolerance-based Branch and Bound algorithms for the ATSP.

Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma

Eur. J. Oper. Res., 2008

2006

Sensitivity analysis of a greedy heuristic for knapsack problems.

Diptesh Ghosh, Nilotpal Chakravarti, Gerard Sierksma

Eur. J. Oper. Res., 2006

Iterative patching and the asymmetric traveling salesman problem.

Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma

Discret. Optim., 2006

2005

A Multilevel Search Algorithm for the Maximization of Submodular Functions Applied to the Quadratic Cost Partition Problem.

Boris Goldengorin, Diptesh Ghosh

J. Glob. Optim., 2005

2004

Branch and peg algorithms for the simple plant location problem.

Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma

Comput. Oper. Res., 2004

2003

Binary knapsack problems with random budgets.

Shubhabrata Das, Diptesh Ghosh

J. Oper. Res. Soc., 2003

Solving the Simple Plant Location Problem using a Data Correcting Approach.

Boris Goldengorin, Gert A. Tijssen, Diptesh Ghosh, Gerard Sierksma

J. Glob. Optim., 2003

Neighborhood search heuristics for the uncapacitated facility location problem.

Diptesh Ghosh

Eur. J. Oper. Res., 2003

2002

Complete Local Search with Memory.

Diptesh Ghosh, Gerard Sierksma

J. Heuristics, 2002

2001

Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem.

Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma

Proceedings of the Algorithm Engineering, 2001

1999

A competitive local search heuristic for the subset sum problem.

Diptesh Ghosh, Nilotpal Chakravarti

Comput. Oper. Res., 1999