Diptesh Ghosh

Orcid: 0000-0002-2565-7856

According to our database1, Diptesh Ghosh authored at least 19 papers between 1999 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

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

2014
An efficient genetic algorithm for single row facility layout.
Optim. Lett., 2014

A scatter search algorithm for the single row facility layout problem.
J. Heuristics, 2014

2013
Speeding Up the Estimation of the Expected Value of Maximum Flow Through Reliable Networks.
IEEE Trans. Reliab., 2013

Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods.
Eur. J. Oper. Res., 2013

Insertion based Lin-Kernighan heuristic for single row facility layout.
Comput. Oper. Res., 2013

2011
Data aggregation for <i>p</i>-median problems.
J. Comb. Optim., 2011

2008
Tolerance-based Branch and Bound algorithms for the ATSP.
Eur. J. Oper. Res., 2008

2006
Sensitivity analysis of a greedy heuristic for knapsack problems.
Eur. J. Oper. Res., 2006

Iterative patching and the asymmetric traveling salesman problem.
Discret. Optim., 2006

2005
A Multilevel Search Algorithm for the Maximization of Submodular Functions Applied to the Quadratic Cost Partition Problem.
J. Glob. Optim., 2005

2004
Branch and peg algorithms for the simple plant location problem.
Comput. Oper. Res., 2004

2003
Binary knapsack problems with random budgets.
J. Oper. Res. Soc., 2003

Solving the Simple Plant Location Problem using a Data Correcting Approach.
J. Glob. Optim., 2003

Neighborhood search heuristics for the uncapacitated facility location problem.
Eur. J. Oper. Res., 2003

2002
Complete Local Search with Memory.
J. Heuristics, 2002

2001
Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem.
Proceedings of the Algorithm Engineering, 2001

1999
A competitive local search heuristic for the subset sum problem.
Comput. Oper. Res., 1999


  Loading...