Diptesh Ghosh at IDEAS
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 ,
plain text ,
BibTeX ,
RIS (EndNote),
ReDIF
Working papers
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!]
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!]
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!]
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!]
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!]
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!]
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!]
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:
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.
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.
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.
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!]
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!]
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!]
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!]
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!]
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!]
Ghosh, D. & Sierksma, G., 2000.
"Complete local search with memory ,"
Research Report
00A47, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
[Downloadable!]
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!]
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
Ghosh, Diptesh & Chakravarti, Nilotpal & Sierksma, Gerard, 2006.
"Sensitivity analysis of a greedy heuristic for knapsack problems ,"
European Journal of Operational Research ,
Elsevier, vol. 127(1), pages 340-350, February.
[Downloadable!] (restricted)
Ghosh, Diptesh, 2003.
"Neighborhood search heuristics for the uncapacitated facility location problem ,"
European Journal of Operational Research ,
Elsevier, vol. 127(1), pages 150-162, October.
[Downloadable!] (restricted) Other versions:
NEP Fields 8 papers by this author were announced in NEP , and specifically in the following field reports (number of papers):
NEP-CMP : Computational Economics (5) 2003-07-29 2003-09-28 2004-04-25 2004-12-12 2006-02-12 Author is listed
Did you know? To receive notification of recent additions to the database, subscribe to the free NEP reports .
This page was last updated on 2008-6-29.
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 .