IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to follow this author

Diptesh Ghosh

This is information that was supplied by Diptesh Ghosh in registering through RePEc. If you are Diptesh Ghosh , you may change this information at the RePEc Author Service. Or if you are not registered and would like to be listed as well, register at the RePEc Author Service. When you register or update your RePEc registration, you may identify the papers and articles you have authored.

Personal Details

First Name:Diptesh
Middle Name:
Last Name:Ghosh
Suffix:
RePEc Short-ID:pgh18
Email:
Homepage:http://www.iimahd.ernet.in/~diptesh
Postal Address:Production & Quantitative Methods Area, Wing 12, Room G, Indian Institute of Management, Vastrapur, Ahmedabad 380015, Gujarat, INDIA.
Phone:
Location: Ahmedabad, India
Homepage: http://www.iimahd.ernet.in/
Email:
Phone:
Fax:
Postal:
Handle: RePEc:edi:iimahin (more details at EDIRC)
in new window

  1. Turkensteen, Marcel & Ghosh, Diptesh & Goldengorin, Boris & Sierksma, Gerard, 2004. "Iterative Patching and the Asymmetric Traveling Salesman Problem," Research Report 04A27, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  2. Goldengorin, Boris & Ghosh, Diptesh, 2004. "A Multilevel Search Algorithm for the Maximization of Submodular Functions," Research Report 04A20, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  3. Goldengorin, Boris & Ghosh, Diptesh & Sierksma, Gerard, 2001. "Branch and peg algorithms for the simple plant location problem," Research Report 01A14, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  4. Goldengorin, Boris, 2001. "Solving the simple plant location problem using a data correcting approach," Research Report 01A53, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  5. Ghosh, Diptesh & Goldengorin, Boris, 2001. "The binary knapsack problem: solutions with guaranteed quality," Research Report 01A64, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  6. Ghosh, D. & Sierksma, G., 2000. "On the complexity of determining tolerances for ->e--optimal solutions to min-max combinatorial optimization problems," Research Report 00A35, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  7. Ghosh, Diptesh & Sierksma, Gerard & Goldengorin, Boris & AlMohammad, Bader F., 2000. "Equivalent instances of the simple plant location problem," Research Report 00A54, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  8. Ghosh, D. & Chakravarti, N. & Sierksma, G., 2000. "Sensitivity analysis of the greedy heuristic for binary knapsack problems," Research Report 00A18, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  9. Ghosh, D. & Das, S., 2000. "Discrete optimization problems with random cost elements," Research Report 00A33, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  10. Sierksma, G. & Ghosh, D., 2000. "Complete local search with memory," Research Report 00A47, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  11. Ramaswamy, R. & Chakravarti, N. & Ghosh, D., 2000. "Complexity of determining exact tolerances for min-max combinatorial optimization problems," Research Report 00A22, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  12. Ghosh, Diptesh, . "Neighborhood Search Heuristicsfor the Uncapacitated Facility Location Problem," IIMA Working Papers WP2002-01-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
  13. Kothari, Ravi & Ghosh, Diptesh, . "Sensitivity Analysis for the Single Row Facility Layout Problem," IIMA Working Papers WP2012-04-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
  14. Ghosh, Diptesh, . "Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems," IIMA Working Papers WP2003-08-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
  15. Ghosh, Diptesh & Goldengorin, Boris, . "The Data-Correcting Algorithmfor the Maximization of Submodular functions: A Multilevel search in thehasse Diagram," IIMA Working Papers WP2002-06-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
  16. Kothari, Ravi & Ghosh, Diptesh, . "A Lin-Kernighan Heuristic for Single Row Facility Layout," IIMA Working Papers WP2012-01-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
  17. Goldengorin, Boris & Ghosh, Diptesh & Sierksma Gerard, . "Data Correcting Algorithms in Combinatorial Optimization," IIMA Working Papers WP2004-04-05, Indian Institute of Management Ahmedabad, Research and Publication Department.
  18. Ghosh, Diptesh, . "An Exponential Neighborhood Local Search Algorithm for the Single Row Facility Location Problem," IIMA Working Papers WP2011-08-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
  19. Ghosh, Diptesh, . "Identifying defective valves in a blowout preventer valve network," IIMA Working Papers WP2013-04-03, Indian Institute of Management Ahmedabad, Research and Publication Department.
  20. Ghosh, Diptesh & Goldengorin, Boris & Sierksma Gerard, . "Data Correcting: A Methodologyfor obtaining near-optimal solutions," IIMA Working Papers WP2002-06-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
  21. Kothari, Ravi & Ghosh, Diptesh, . "Path Relinking for Single Row Facility Layout," IIMA Working Papers WP2012-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
  22. Ghosh, Diptesh, . "A Diversification Operator for Genetic Algorithms," IIMA Working Papers WP2011-01-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
  23. Kothari, Ravi & Ghosh, Diptesh, . "A Competitive Genetic Algorithm for Single Row Facility Layout," IIMA Working Papers WP2012-03-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
  24. Kothari, Ravi & Ghosh, Diptesh, . "Tabu Search for the Single Row Facility Layout Problem in FMS using a 3-opt Neighborhood," IIMA Working Papers WP2012-02-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
  25. Kothari, Ravi & Ghosh, Diptesh, . "Scatter Search Algorithms for the Single Row Facility Layout Problem," IIMA Working Papers WP2012-04-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
  26. Vatsa, Amit Kumar & Ghosh, Diptesh, . "Tabu Search for Multi-Period Facility Location: Uncapacitated Problem with an Uncertain Number of Servers," IIMA Working Papers WP2014-11-03, Indian Institute of Management Ahmedabad, Research and Publication Department.
  27. Kothari, Ravi & Ghosh, Diptesh, . "The Single Row Facility Layout Problem: State of the Art," IIMA Working Papers WP2011-12-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
  28. Ghosh, Diptesh, . "On the Blowout Preventer Testing Problem: An Approach to Checking for Leakage in BOP Networks," IIMA Working Papers WP2012-01-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
  29. Ghosh, Diptesh & Goldengorin, Boris, . "Obtaining Near OptimalSolutions for the Binary Knapsack Problem," IIMA Working Papers WP2002-02-03, Indian Institute of Management Ahmedabad, Research and Publication Department.
  30. Ghosh, Diptesh & Bandyopadhyay, Tathagata, . "Spotting Difficult Weakly Correlated Binary Knapsack Problems," IIMA Working Papers WP2006-01-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
  31. Ghosh, Diptesh, . "A Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem," IIMA Working Papers WP2003-07-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
  32. Kothari, Ravi & Ghosh, Diptesh, . "Tabu Search for the Single Row Facility Layout Problem Using Exhaustive 2-Opt and Insertion Neighborhoods," IIMA Working Papers WP2012-01-03, Indian Institute of Management Ahmedabad, Research and Publication Department.
  33. Ghosh, Diptesh & Kothari, Ravi, . "Population Heuristics for the Corridor Allocation Problem," IIMA Working Papers WP2012-09-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
  1. Kothari, Ravi & Ghosh, Diptesh, 2013. "Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods," European Journal of Operational Research, Elsevier, vol. 224(1), pages 93-100.
  2. Turkensteen, Marcel & Ghosh, Diptesh & Goldengorin, Boris & Sierksma, Gerard, 2008. "Tolerance-based Branch and Bound algorithms for the ATSP," European Journal of Operational Research, Elsevier, vol. 189(3), pages 775-788, September.
  3. Ghosh, Diptesh & Chakravarti, Nilotpal & Sierksma, Gerard, 2006. "Sensitivity analysis of a greedy heuristic for knapsack problems," European Journal of Operational Research, Elsevier, vol. 169(1), pages 340-350, February.
  4. Ghosh, Diptesh, 2003. "Neighborhood search heuristics for the uncapacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 150(1), pages 150-162, October.
6 papers by this author were announced in NEP, and specifically in the following field reports (number of papers):
  1. NEP-CMP: Computational Economics (2) 2004-12-12 2015-01-03. Author is listed

Most cited item

Most downloaded item (past 12 months)

Access and download statistics for all items

For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Diptesh Ghosh should log into the RePEc Author Service

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.