 | 2011 |
|---|
| 10 |       | Bader F. AlBdaiwi,
Diptesh Ghosh,
Boris Goldengorin:
Data aggregation for p-median problems.
J. Comb. Optim. 21(3): 348-363 (2011) |
| 2008 |
|---|
| 9 | | Marcel Turkensteen,
Diptesh Ghosh,
Boris Goldengorin,
Gerard Sierksma:
Tolerance-based Branch and Bound algorithms for the ATSP.
European Journal of Operational Research 189(3): 775-788 (2008) |
| 2006 |
|---|
| 8 | | Marcel Turkensteen,
Diptesh Ghosh,
Boris Goldengorin,
Gerard Sierksma:
Iterative patching and the asymmetric traveling salesman problem.
Discrete Optimization 3(1): 63-77 (2006) |
| 7 | | Diptesh Ghosh,
Nilotpal Chakravarti,
Gerard Sierksma:
Sensitivity analysis of a greedy heuristic for knapsack problems.
European Journal of Operational Research 169(1): 340-350 (2006) |
| 2004 |
|---|
| 6 | | Boris Goldengorin,
Diptesh Ghosh,
Gerard Sierksma:
Branch and peg algorithms for the simple plant location problem.
Computers & OR 31(2): 241-255 (2004) |
| 2003 |
|---|
| 5 | | Boris Goldengorin,
Diptesh Ghosh,
Gerard Sierksma:
Branch and peg algorithms for the simple plant location problem.
Computers & OR 30(7): 967-981 (2003) |
| 4 | | Diptesh Ghosh:
Neighborhood search heuristics for the uncapacitated facility location problem.
European Journal of Operational Research 150(1): 150-162 (2003) |
| 2002 |
|---|
| 3 | | Diptesh Ghosh,
Gerard Sierksma:
Complete Local Search with Memory.
J. Heuristics 8(6): 571-584 (2002) |
| 2001 |
|---|
| 2 | | Boris Goldengorin,
Diptesh Ghosh,
Gerard Sierksma:
Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem.
Algorithm Engineering 2001: 106-117 |
| 1999 |
|---|
| 1 | | Diptesh Ghosh,
Nilotpal Chakravarti:
A competitive local search heuristic for the subset sum problem.
Computers & OR 26(3): 271-279 (1999) |
Data released under the ODC-BY 1.0 license — See also our legal information page