Details about Diptesh Ghosh

Access statistics for papers by Diptesh Ghosh.

Last updated 2009-01-06. Update your information in the RePEc Author Service.

Short-id: pgh18

Working Papers

2008

1. A review of the Tabu Search Literature on Traveling Salesman Problems
   IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department View citations
2. Implementing Tabu Search to Exploit Sparsity in ATSP Instances
   IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department

2006

3. An empirical investigation into randomly generated Euclidean symmetric traveling salesman problems
   IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department
4. Spotting Difficult Weakly Correlated Binary Knapsack Problems
   IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department

2004

5. Data Correcting Algorithms in Combinatorial Optimization
   IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department
6. Iterative Patching and the Asymmetric Traveling Salesman Problem
   Research Report, University of Groningen, Research Institute SOM (Systems, Organisations and Management)
7. A Multilevel Search Algorithm for the Maximization of Submodular Functions
   Research Report, University of Groningen, Research Institute SOM (Systems, Organisations and Management)

2003

8. A Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem
   IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department
9. Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems
   IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department

2002

10. Data Correcting: A Methodologyfor obtaining near-optimal solutions
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department
11. Neighborhood Search Heuristicsfor the Uncapacitated Facility Location Problem
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department
    See also Journal Article in European Journal of Operational Research (2003)
12. Obtaining Near OptimalSolutions for the Binary Knapsack Problem
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department
13. The Data-Correcting Algorithmfor the Maximization of Submodular functions: A Multilevel search in thehasse Diagram
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department

2001

14. Branch and peg algorithms for the simple plant location problem
    Research Report, University of Groningen, Research Institute SOM (Systems, Organisations and Management) View citations
15. Solving the simple plant location problem using a data correcting approach
    Research Report, University of Groningen, Research Institute SOM (Systems, Organisations and Management)
16. The binary knapsack problem: solutions with guaranteed quality
    Research Report, University of Groningen, Research Institute SOM (Systems, Organisations and Management)

2000

17. Complete local search with memory
    Research Report, University of Groningen, Research Institute SOM (Systems, Organisations and Management)
18. Complexity of determining exact tolerances for min-max combinatorial optimization problems
    Research Report, University of Groningen, Research Institute SOM (Systems, Organisations and Management)
19. Discrete optimization problems with random cost elements
    Research Report, University of Groningen, Research Institute SOM (Systems, Organisations and Management)
20. Equivalent instances of the simple plant location problem
    Research Report, University of Groningen, Research Institute SOM (Systems, Organisations and Management)
21. On the complexity of determining tolerances for ->e--optimal solutions to min-max combinatorial optimization problems
    Research Report, University of Groningen, Research Institute SOM (Systems, Organisations and Management)
22. Sensitivity analysis of the greedy heuristic for binary knapsack problems
    Research Report, University of Groningen, Research Institute SOM (Systems, Organisations and Management)

Journal Articles

2008

1. Tolerance-based Branch and Bound algorithms for the ATSP
   European Journal of Operational Research, 2008, 189, (3), 775-788

2006

2. Sensitivity analysis of a greedy heuristic for knapsack problems
   European Journal of Operational Research, 2006, 169, (1), 340-350

2003

3. Neighborhood search heuristics for the uncapacitated facility location problem
   European Journal of Operational Research, 2003, 150, (1), 150-162 View citations
   See also Working Paper (2002)
4. On the probability of extinction of a Galton-Watson process
   Statistics & Probability Letters, 2003, 65, (3), 195-198