This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Information about:
Diptesh Ghosh

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

Other registered authors

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:

Affiliation

(in no particular order)

Works

| Working papers | Articles | Access and download statistics | Citations (if any)| NEP Fields |
Download all references for this author: available formats: HTML (with abstracts), plain text (with abstracts), BibTeX, RIS (EndNote), ReDIF

Working papers

  1. Sumanta Basu,Diptesh Ghosh, 2008. "A review of the Tabu Search Literature on Traveling Salesman Problems," IIMA Working Papers 2008-10-01, Indian Institute of Management Ahmedabad, Research and Publication Department. [Downloadable!]

  2. Sumanta Basu,Ravindra S. Gajulapalli,Diptesh Ghosh, 2008. "Implementing Tabu Search to Exploit Sparsity in ATSP Instances," IIMA Working Papers 2008-10-02, Indian Institute of Management Ahmedabad, Research and Publication Department. [Downloadable!]

  3. Ghosh Diptesh & Bandopadhyay Tathagata, 2006. "Spotting Difficult Weakly Correlated Binary Knapsack Problems," IIMA Working Papers 2006-01-04, Indian Institute of Management Ahmedabad, Research and Publication Department. [Downloadable!]

  4. Sharma Megha & Ghosh Diptesh, 2006. "An empirical investigation into randomly generated Euclidean symmetric traveling salesman problems," IIMA Working Papers 2006-06-03, Indian Institute of Management Ahmedabad, Research and Publication Department. [Downloadable!]

  5. Goldengorin Boris & Ghosh Diptesh & Sierksma Gerard, 2004. "Data Correcting Algorithms in Combinatorial Optimization," IIMA Working Papers 2004-04-05, Indian Institute of Management Ahmedabad, Research and Publication Department. [Downloadable!]

  6. 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). [Downloadable!]

  7. 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). [Downloadable!]

  8. Ghosh Diptesh, 2003. "Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems," IIMA Working Papers 2003-08-02, Indian Institute of Management Ahmedabad, Research and Publication Department. [Downloadable!]

  9. Ghosh Diptesh, 2003. "A Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem," IIMA Working Papers 2003-07-02, Indian Institute of Management Ahmedabad, Research and Publication Department. [Downloadable!]

  10. Ghosh Diptesh, 2002. "Neighborhood Search Heuristicsfor the Uncapacitated Facility Location Problem," IIMA Working Papers 2002-01-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    Published as:

  11. Ghosh Diptesh & Goldengorin Boris, 2002. "Obtaining Near OptimalSolutions for the Binary Knapsack Problem," IIMA Working Papers 2002-02-03, Indian Institute of Management Ahmedabad, Research and Publication Department.

  12. Ghosh Diptesh & Goldengorin Boris, 2002. "The Data-Correcting Algorithmfor the Maximization of Submodular functions: A Multilevel search in thehasse Diagram," IIMA Working Papers 2002-06-02, Indian Institute of Management Ahmedabad, Research and Publication Department.

  13. Ghosh Diptesh & Goldengorin Boris & Sierksma Gerard, 2002. "Data Correcting: A Methodologyfor obtaining near-optimal solutions," IIMA Working Papers 2002-06-01, Indian Institute of Management Ahmedabad, Research and Publication Department.

  14. 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). [Downloadable!]

  15. 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). [Downloadable!]

  16. 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). [Downloadable!]

  17. Goldengorin, B. & Ghosh, D. & Sierksma, G., 2000. "Equivalent instances of the simple plant location problem," Research Report 00A54, University of Groningen, Research Institute SOM (Systems, Organisations and Management). [Downloadable!]

  18. 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). [Downloadable!]

  19. 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). [Downloadable!]

  20. Ghosh, D. & Sierksma, G., 2000. "Complete local search with memory," Research Report 00A47, University of Groningen, Research Institute SOM (Systems, Organisations and Management). [Downloadable!]

  21. 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). [Downloadable!]

  22. 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). [Downloadable!]

Articles

  1. 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. [Downloadable!] (restricted)

  2. 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. [Downloadable!] (restricted)

  3. Ghosh, Yashowanto N., 2003. "On the probability of extinction of a Galton-Watson process," Statistics & Probability Letters, Elsevier, vol. 65(3), pages 195-198, November. [Downloadable!] (restricted)

  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. [Downloadable!] (restricted)
    Other versions:

NEP Fields

10 papers by this author were announced in NEP, and specifically in the following field reports (number of papers):
  1. NEP-CMP: Computational Economics (6) 2003-07-29 2003-09-28 2004-04-25 2004-12-12 2006-02-12 2008-10-28 Author is listed
Did you know? RePEc encourages publishers to make their bibliographic data freely available to the public.

This page was last updated on 2009-11-10.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.