Search the dblp DataBase
Diptesh Ghosh: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem. [Citation Graph (0, 0)][DBLP]
Algorithm Engineering, 2001, pp:106-117 [Conf] - Diptesh Ghosh, Nilotpal Chakravarti
A competitive local search heuristic for the subset sum problem. [Citation Graph (0, 0)][DBLP]
Computers & OR, 1999, v:26, n:3, pp:271-279 [Journal] - Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
Branch and peg algorithms for the simple plant location problem. [Citation Graph (0, 0)][DBLP]
Computers & OR, 2003, v:30, n:7, pp:967-981 [Journal] - Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
Branch and peg algorithms for the simple plant location problem. [Citation Graph (0, 0)][DBLP]
Computers & OR, 2004, v:31, n:2, pp:241-255 [Journal] - Diptesh Ghosh, Gerard Sierksma
Complete Local Search with Memory. [Citation Graph (0, 0)][DBLP]
J. Heuristics, 2002, v:8, n:6, pp:571-584 [Journal] - Diptesh Ghosh, Nilotpal Chakravarti, Gerard Sierksma
Sensitivity analysis of a greedy heuristic for knapsack problems. [Citation Graph (0, 0)][DBLP]
European Journal of Operational Research, 2006, v:169, n:1, pp:340-350 [Journal] - Diptesh Ghosh
Neighborhood search heuristics for the uncapacitated facility location problem. [Citation Graph (0, 0)][DBLP]
European Journal of Operational Research, 2003, v:150, n:1, pp:150-162 [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002