IDEAS home Printed from https://ideas.repec.org/e/pgh18.html
   My authors  Follow this author

Diptesh Ghosh

Personal Details

First Name:Diptesh
Middle Name:
Last Name:Ghosh
Suffix:
RePEc Short-ID:pgh18
http://faculty.iima.ac.in/~diptesh
Production & Quantitative Methods Area, Wing 12, Room G, Indian Institute of Management, Vastrapur, Ahmedabad 380015, Gujarat, INDIA.
Terminal Degree:1998 Indian Institute of Management Calcutta (IIMCAL) (from RePEc Genealogy)

Affiliation

Indian Institute of Management Ahmedabad (IIMA)

Ahmedabad, India
http://www.iima.ac.in/

: 91 79 66324125
91 79 66326896

RePEc:edi:iimahin (more details at EDIRC)

Research output

as
Jump to: Working papers Articles

Working papers

  1. Diptesh Ghosh & Anindya S. Chakrabarti, 2017. "Emergence of Distributed Coordination in the Kolkata Paise Restaurant Problem with Finite Information," Papers 1702.01017, arXiv.org.
  2. Ghosh, Diptesh, 2016. "Exploring Lin Kernighan neighborhoods for the indexing problem," IIMA Working Papers WP2016-02-13, Indian Institute of Management Ahmedabad, Research and Publication Department.
  3. S. Agarwal & D. Ghosh & A. S. Chakrabarti, 2016. "Self-organization in a distributed coordination game through heuristic rules," Papers 1608.00213, arXiv.org.
  4. Ghosh, Diptesh, 2016. "A new genetic algorithm for the tool indexing problem," IIMA Working Papers WP2016-03-17, Indian Institute of Management Ahmedabad, Research and Publication Department.
  5. Ghosh, Diptesh, 2016. "Allocating tools to index positions in tool magazines using tabu search," IIMA Working Papers WP2016-02-06, Indian Institute of Management Ahmedabad, Research and Publication Department.
  6. Ghosh, Diptesh, 2016. "Speeding up neighborhood search for the tool indexing problem," IIMA Working Papers WP2016-09-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
  7. Ghosh, Diptesh, 2016. "Comparing Genetic Algorithm Crossover and Mutation Operators for the Indexing Problem," IIMA Working Papers WP2016-03-29, Indian Institute of Management Ahmedabad, Research and Publication Department.
  8. Diptesh Ghosh, 2016. "Incorporating gender and age in genetic algorithms to solve the indexing problem," Working Papers id:11034, eSocialSciences.
  9. Ghosh, Diptesh, 2015. "A Quadratic Programming Formulation of the Equidistant Bi-directional Loop Layout Problem," IIMA Working Papers WP2015-10-05, Indian Institute of Management Ahmedabad, Research and Publication Department.
  10. Vatsa, Amit Kumar & Ghosh, Diptesh, 2014. "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.
  11. Ghosh, Diptesh, 2013. "Identifying defective valves in a blowout preventer valve network," IIMA Working Papers WP2013-04-03, Indian Institute of Management Ahmedabad, Research and Publication Department.
  12. Kothari, Ravi & Ghosh, Diptesh, 2012. "A Competitive Genetic Algorithm for Single Row Facility Layout," IIMA Working Papers WP2012-03-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
  13. Kothari, Ravi & Ghosh, Diptesh, 2012. "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.
  14. Kothari, Ravi & Ghosh, Diptesh, 2012. "Path Relinking for Single Row Facility Layout," IIMA Working Papers WP2012-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
  15. Ghosh, Diptesh & Kothari, Ravi, 2012. "Population Heuristics for the Corridor Allocation Problem," IIMA Working Papers WP2012-09-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
  16. Ghosh, Diptesh, 2012. "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.
  17. Kothari, Ravi & Ghosh, Diptesh, 2012. "Sensitivity Analysis for the Single Row Facility Layout Problem," IIMA Working Papers WP2012-04-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
  18. Kothari, Ravi & Ghosh, Diptesh, 2012. "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.
  19. Kothari, Ravi & Ghosh, Diptesh, 2012. "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.
  20. Kothari, Ravi & Ghosh, Diptesh, 2012. "A Lin-Kernighan Heuristic for Single Row Facility Layout," IIMA Working Papers WP2012-01-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
  21. Ghosh, Diptesh, 2011. "A Diversification Operator for Genetic Algorithms," IIMA Working Papers WP2011-01-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
  22. Ghosh, Diptesh, 2011. "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.
  23. Kothari, Ravi & Ghosh, Diptesh, 2011. "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.
  24. Ghosh, Diptesh & Bandyopadhyay, Tathagata, 2006. "Spotting Difficult Weakly Correlated Binary Knapsack Problems," IIMA Working Papers WP2006-01-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
  25. Goldengorin, Boris & Ghosh, Diptesh & Sierksma Gerard, 2004. "Data Correcting Algorithms in Combinatorial Optimization," IIMA Working Papers WP2004-04-05, Indian Institute of Management Ahmedabad, Research and Publication Department.
  26. 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).
  27. 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).
  28. Ghosh, Diptesh, 2003. "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.
  29. Ghosh, Diptesh, 2003. "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.
  30. Ghosh, Diptesh, 2002. "Neighborhood Search Heuristicsfor the Uncapacitated Facility Location Problem," IIMA Working Papers WP2002-01-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
  31. Ghosh, Diptesh & Goldengorin, Boris & Sierksma Gerard, 2002. "Data Correcting: A Methodologyfor obtaining near-optimal solutions," IIMA Working Papers WP2002-06-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
  32. Ghosh, Diptesh & Goldengorin, Boris, 2002. "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.
  33. Ghosh, Diptesh & Goldengorin, Boris, 2002. "Obtaining Near OptimalSolutions for the Binary Knapsack Problem," IIMA Working Papers WP2002-02-03, Indian Institute of Management Ahmedabad, Research and Publication Department.
  34. 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).
  35. 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).
  36. Sierksma, G. & Ghosh, D., 2000. "Complete local search with memory," Research Report 00A47, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  37. 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).
  38. 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).
  39. 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).
  40. 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).
  41. 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).

Articles

  1. Ghosh, Diptesh & Chakrabarti, Anindya S., 2017. "Emergence of distributed coordination in the Kolkata Paise Restaurant problem with finite information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 483(C), pages 16-24.
  2. Shubham Agarwal & Diptesh Ghosh & Anindya S. Chakrabarti, 2016. "Self-organization in a distributed coordination game through heuristic rules," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 89(12), pages 1-10, December.
  3. 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.
  4. 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.
  5. 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.
  6. S Das & D Ghosh, 2003. "Binary knapsack problems with random budgets," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(9), pages 970-983, September.
  7. 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.

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Working papers

  1. Diptesh Ghosh & Anindya S. Chakrabarti, 2017. "Emergence of Distributed Coordination in the Kolkata Paise Restaurant Problem with Finite Information," Papers 1702.01017, arXiv.org.

    Cited by:

    1. Kiran Sharma & Anamika & Anindya S. Chakrabarti & Anirban Chakraborti & Sujoy Chakravarty, 2017. "The Saga of KPR: Theoretical and Experimental developments," Papers 1712.06358, arXiv.org.

  2. Ghosh, Diptesh, 2016. "Allocating tools to index positions in tool magazines using tabu search," IIMA Working Papers WP2016-02-06, Indian Institute of Management Ahmedabad, Research and Publication Department.

    Cited by:

    1. Ghosh, Diptesh, 2016. "Exploring Lin Kernighan neighborhoods for the indexing problem," IIMA Working Papers WP2016-02-13, Indian Institute of Management Ahmedabad, Research and Publication Department.
    2. Diptesh Ghosh, 2016. "Incorporating gender and age in genetic algorithms to solve the indexing problem," Working Papers id:11034, eSocialSciences.
    3. Ghosh, Diptesh, 2016. "A new genetic algorithm for the tool indexing problem," IIMA Working Papers WP2016-03-17, Indian Institute of Management Ahmedabad, Research and Publication Department.

  3. Vatsa, Amit Kumar & Ghosh, Diptesh, 2014. "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.

    Cited by:

    1. Vatsa, Amit Kumar & Jayaswal, Sachin, 2015. "A New Formulation and Benders' Decomposition for Multi-period facility Location Problem with Server Uncertainty," IIMA Working Papers WP2015-02-07, Indian Institute of Management Ahmedabad, Research and Publication Department.

  4. Kothari, Ravi & Ghosh, Diptesh, 2012. "A Competitive Genetic Algorithm for Single Row Facility Layout," IIMA Working Papers WP2012-03-01, Indian Institute of Management Ahmedabad, Research and Publication Department.

    Cited by:

    1. Parveen Sharma & Sandeep Singhal, 2017. "Analysis of facility layout alternatives using proposed integrated approach," OPSEARCH, Springer;Operational Research Society of India, vol. 54(1), pages 1-20, March.
    2. Kothari, Ravi & Ghosh, Diptesh, 2012. "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.
    3. Palubeckis, Gintaras, 2015. "Fast local search for single row facility layout," European Journal of Operational Research, Elsevier, vol. 246(3), pages 800-814.

  5. Kothari, Ravi & Ghosh, Diptesh, 2012. "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.

    Cited by:

    1. Keller, Birgit & Buscher, Udo, 2015. "Single row layout models," European Journal of Operational Research, Elsevier, vol. 245(3), pages 629-644.
    2. Zeng, Zhizhong & Yu, Xinguo & He, Kun & Huang, Wenqi & Fu, Zhanghua, 2016. "Iterated Tabu Search and Variable Neighborhood Descent for packing unequal circles into a circular container," European Journal of Operational Research, Elsevier, vol. 250(2), pages 615-627.
    3. Guan, Jian & Lin, Geng, 2016. "Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem," European Journal of Operational Research, Elsevier, vol. 248(3), pages 899-909.
    4. Kothari, Ravi & Ghosh, Diptesh, 2012. "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.
    5. Kothari, Ravi & Ghosh, Diptesh, 2012. "A Lin-Kernighan Heuristic for Single Row Facility Layout," IIMA Working Papers WP2012-01-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
    6. Palubeckis, Gintaras, 2015. "Fast local search for single row facility layout," European Journal of Operational Research, Elsevier, vol. 246(3), pages 800-814.
    7. Hungerländer, Philipp & Anjos, Miguel F., 2015. "A semidefinite optimization-based approach for global optimization of multi-row facility layout," European Journal of Operational Research, Elsevier, vol. 245(1), pages 46-61.
    8. Ghosh, Diptesh & Kothari, Ravi, 2012. "Population Heuristics for the Corridor Allocation Problem," IIMA Working Papers WP2012-09-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    9. Kothari, Ravi & Ghosh, Diptesh, 2012. "Sensitivity Analysis for the Single Row Facility Layout Problem," IIMA Working Papers WP2012-04-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    10. Kothari, Ravi & Ghosh, Diptesh, 2012. "Path Relinking for Single Row Facility Layout," IIMA Working Papers WP2012-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.

  6. Kothari, Ravi & Ghosh, Diptesh, 2012. "Path Relinking for Single Row Facility Layout," IIMA Working Papers WP2012-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.

    Cited by:

    1. Parveen Sharma & Sandeep Singhal, 2017. "Analysis of facility layout alternatives using proposed integrated approach," OPSEARCH, Springer;Operational Research Society of India, vol. 54(1), pages 1-20, March.
    2. Keller, Birgit & Buscher, Udo, 2015. "Single row layout models," European Journal of Operational Research, Elsevier, vol. 245(3), pages 629-644.

  7. Ghosh, Diptesh, 2012. "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.

    Cited by:

    1. Ghosh, Diptesh, 2013. "Identifying defective valves in a blowout preventer valve network," IIMA Working Papers WP2013-04-03, Indian Institute of Management Ahmedabad, Research and Publication Department.

  8. Kothari, Ravi & Ghosh, Diptesh, 2012. "Sensitivity Analysis for the Single Row Facility Layout Problem," IIMA Working Papers WP2012-04-02, Indian Institute of Management Ahmedabad, Research and Publication Department.

    Cited by:

    1. Parveen Sharma & Sandeep Singhal, 2017. "Analysis of facility layout alternatives using proposed integrated approach," OPSEARCH, Springer;Operational Research Society of India, vol. 54(1), pages 1-20, March.
    2. Keller, Birgit & Buscher, Udo, 2015. "Single row layout models," European Journal of Operational Research, Elsevier, vol. 245(3), pages 629-644.
    3. Palubeckis, Gintaras, 2015. "Fast simulated annealing for single-row equidistant facility layout," Applied Mathematics and Computation, Elsevier, vol. 263(C), pages 287-301.

  9. Kothari, Ravi & Ghosh, Diptesh, 2012. "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.

    Cited by:

    1. Parveen Sharma & Sandeep Singhal, 2017. "Analysis of facility layout alternatives using proposed integrated approach," OPSEARCH, Springer;Operational Research Society of India, vol. 54(1), pages 1-20, March.
    2. Palubeckis, Gintaras, 2015. "Fast simulated annealing for single-row equidistant facility layout," Applied Mathematics and Computation, Elsevier, vol. 263(C), pages 287-301.
    3. Mangesh Gharote & Rahul Patil & Sachin Lodha, 2017. "Scatter search for trainees to software project requirements stable allocation," Journal of Heuristics, Springer, vol. 23(4), pages 257-283, August.
    4. Ghosh, Diptesh & Kothari, Ravi, 2012. "Population Heuristics for the Corridor Allocation Problem," IIMA Working Papers WP2012-09-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    5. Kothari, Ravi & Ghosh, Diptesh, 2012. "Path Relinking for Single Row Facility Layout," IIMA Working Papers WP2012-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.

  10. Kothari, Ravi & Ghosh, Diptesh, 2012. "A Lin-Kernighan Heuristic for Single Row Facility Layout," IIMA Working Papers WP2012-01-04, Indian Institute of Management Ahmedabad, Research and Publication Department.

    Cited by:

    1. Ghosh, Diptesh, 2016. "Exploring Lin Kernighan neighborhoods for the indexing problem," IIMA Working Papers WP2016-02-13, Indian Institute of Management Ahmedabad, Research and Publication Department.
    2. Parveen Sharma & Sandeep Singhal, 2017. "Analysis of facility layout alternatives using proposed integrated approach," OPSEARCH, Springer;Operational Research Society of India, vol. 54(1), pages 1-20, March.
    3. Kothari, Ravi & Ghosh, Diptesh, 2012. "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.
    4. Ghosh, Diptesh & Kothari, Ravi, 2012. "Population Heuristics for the Corridor Allocation Problem," IIMA Working Papers WP2012-09-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    5. Kothari, Ravi & Ghosh, Diptesh, 2012. "Path Relinking for Single Row Facility Layout," IIMA Working Papers WP2012-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.

  11. Ghosh, Diptesh, 2011. "A Diversification Operator for Genetic Algorithms," IIMA Working Papers WP2011-01-02, Indian Institute of Management Ahmedabad, Research and Publication Department.

    Cited by:

    1. Diptesh Ghosh, 2016. "Incorporating gender and age in genetic algorithms to solve the indexing problem," Working Papers id:11034, eSocialSciences.

  12. Kothari, Ravi & Ghosh, Diptesh, 2011. "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.

    Cited by:

    1. Keller, Birgit & Buscher, Udo, 2015. "Single row layout models," European Journal of Operational Research, Elsevier, vol. 245(3), pages 629-644.
    2. Kothari, Ravi & Ghosh, Diptesh, 2012. "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.
    3. Kothari, Ravi & Ghosh, Diptesh, 2012. "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.
    4. Kothari, Ravi & Ghosh, Diptesh, 2012. "A Lin-Kernighan Heuristic for Single Row Facility Layout," IIMA Working Papers WP2012-01-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
    5. Ghosh, Diptesh, 2016. "Allocating tools to index positions in tool magazines using tabu search," IIMA Working Papers WP2016-02-06, Indian Institute of Management Ahmedabad, Research and Publication Department.
    6. Parveen Sharma & Sandeep Singhal, 2016. "Design and evaluation of layout alternatives to enhance the performance of industry," OPSEARCH, Springer;Operational Research Society of India, vol. 53(4), pages 741-760, December.
    7. Ahonen, H. & de Alvarenga, A.G. & Amaral, A.R.S., 2014. "Simulated annealing and tabu search approaches for the Corridor Allocation Problem," European Journal of Operational Research, Elsevier, vol. 232(1), pages 221-233.

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

    Cited by:

    1. 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).

  14. 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).

    Cited by:

    1. Kampars Janis & Shmite Elina, 2014. "STORN: Solution to Traversal of Road Networks/ RCTI: izbraucama ceļu tīkla risinājums/ РПДС: Решение дорожных сетей для проезда," Information Technology and Management Science, Sciendo, vol. 17(1), pages 74-80, December.
    2. Jamal Ouenniche & Prasanna K. Ramaswamy & Michel Gendreau, 2017. "A dual local search framework for combinatorial optimization problems with TSP application," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1377-1398, November.

  15. Ghosh, Diptesh, 2003. "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.

    Cited by:

    1. Öncan, Temel & Cordeau, Jean-François & Laporte, Gilbert, 2008. "A tabu search heuristic for the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 191(2), pages 306-319, December.

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

    Cited by:

    1. Resende, Mauricio G.C. & Werneck, Renato F., 2006. "A hybrid multistart heuristic for the uncapacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 174(1), pages 54-68, October.
    2. Aras, Necati & Aksen, Deniz, 2008. "Locating collection centers for distance- and incentive-dependent returns," International Journal of Production Economics, Elsevier, vol. 111(2), pages 316-333, February.
    3. Galli, Laura & Letchford, Adam N. & Miller, Sebastian J., 2018. "New valid inequalities and facets for the Simple Plant Location Problem," European Journal of Operational Research, Elsevier, vol. 269(3), pages 824-833.
    4. Marta Sofia R. Monteiro & Dalila B. M. M. Fontes & Fernando A. C. C. Fontes, 2009. "Restructuring Facility Networks under Economy of Scales," FEP Working Papers 324, Universidade do Porto, Faculdade de Economia do Porto.
    5. Minghe Sun & Zhen-Yu Chen & Zhi-Ping Fan, 2014. "A Multi-task Multi-kernel Transfer Learning Method for Customer Response Modeling in Social Media," Working Papers 0161mss, College of Business, University of Texas at San Antonio.
    6. Mina Husseinzadeh Kashan & Ali Husseinzadeh Kashan & Nasim Nahavandi, 2013. "A novel differential evolution algorithm for binary optimization," Computational Optimization and Applications, Springer, vol. 55(2), pages 481-513, June.
    7. Kurt Jörnsten & Andreas Klose, 2016. "An improved Lagrangian relaxation and dual ascent approach to facility location problems," Computational Management Science, Springer, vol. 13(3), pages 317-348, July.
    8. Melo, M.T. & Nickel, S. & Saldanha-da-Gama, F., 2012. "A tabu search heuristic for redesigning a multi-echelon supply chain network over a planning horizon," International Journal of Production Economics, Elsevier, vol. 136(1), pages 218-230.
    9. Letchford, Adam N. & Miller, Sebastian J., 2014. "An aggressive reduction scheme for the simple plant location problem," European Journal of Operational Research, Elsevier, vol. 234(3), pages 674-682.
    10. Jesica Armas & Angel A. Juan & Joan M. Marquès & João Pedro Pedroso, 2017. "Solving the deterministic and stochastic uncapacitated facility location problem: from a heuristic to a simheuristic," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(10), pages 1161-1176, October.
    11. J Brimberg & P Hansen & G Laporte & N Mladenović & D Urošević, 2008. "The maximum return-on-investment plant location problem with market share," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 399-406, March.
    12. Arostegui, Marvin Jr. & Kadipasaoglu, Sukran N. & Khumawala, Basheer M., 2006. "An empirical comparison of Tabu Search, Simulated Annealing, and Genetic Algorithms for facilities location problems," International Journal of Production Economics, Elsevier, vol. 103(2), pages 742-754, October.
    13. Dohn, Anders & Christensen, Soren Gram & Rousoe, David Magid, 2007. "The p/q-active uncapacitated facility location problem: Investigation of the solution space and an LP-fitting heuristic," European Journal of Operational Research, Elsevier, vol. 180(2), pages 532-546, July.
    14. Dupont, Lionel, 2008. "Branch and bound algorithm for a facility location problem with concave site dependent costs," International Journal of Production Economics, Elsevier, vol. 112(1), pages 245-254, March.
    15. van der Gaast, J.P. & Rietveld, C.A. & Gabor, A.F. & Zhang, Y., 2011. "A Local Search Algorithm for Clustering in Software as a Service Networks," ERIM Report Series Research in Management ERS-2011-004-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    16. C. Beltran-Royo & J.-P. Vial & A. Alonso-Ayuso, 2012. "Semi-Lagrangian relaxation applied to the uncapacitated facility location problem," Computational Optimization and Applications, Springer, vol. 51(1), pages 387-409, January.
    17. Cordeau, Jean-François & Laporte, Gilbert & Pasin, Federico, 2008. "An iterated local search heuristic for the logistics network design problem with single assignment," International Journal of Production Economics, Elsevier, vol. 113(2), pages 626-640, June.
    18. Minghe Sun, 2008. "A Tabu Search Heuristic Procedure for the Capacitated Facility Location Problem," Working Papers 0050, College of Business, University of Texas at San Antonio.

  17. 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).

    Cited by:

    1. M. Neema & K. Maniruzzaman & A. Ohgai, 2011. "New Genetic Algorithms Based Approaches to Continuous p-Median Problem," Networks and Spatial Economics, Springer, vol. 11(1), pages 83-99, March.
    2. Rafael Pastor & Albert Corominas, 2004. "Branch and win: OR tree search algorithms for solving combinatorial optimisation problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 12(1), pages 169-191, June.
    3. 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).

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

    Cited by:

    1. Marta Sofia R. Monteiro & Dalila B. M. M. Fontes & Fernando A. C. C. Fontes, 2009. "Restructuring Facility Networks under Economy of Scales," FEP Working Papers 324, Universidade do Porto, Faculdade de Economia do Porto.

  19. 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).

    Cited by:

    1. S Das & D Ghosh, 2003. "Binary knapsack problems with random budgets," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(9), pages 970-983, September.

  20. 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).

    Cited by:

    1. 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).
    2. 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).

Articles

  1. Ghosh, Diptesh & Chakrabarti, Anindya S., 2017. "Emergence of distributed coordination in the Kolkata Paise Restaurant problem with finite information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 483(C), pages 16-24.
    See citations under working paper version above.
  2. 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.
    See citations under working paper version above.
  3. 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.

    Cited by:

    1. Vyacheslav V. Chistyakov & Panos M. Pardalos, 2015. "Stability Analysis in Discrete Optimization Involving Generalized Addition Operations," Journal of Optimization Theory and Applications, Springer, vol. 167(2), pages 585-616, November.
    2. Almoustafa, Samira & Hanafi, Said & Mladenović, Nenad, 2013. "New exact method for large asymmetric distance-constrained vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 226(3), pages 386-394.
    3. Izabela Nielsen & Quang-Vinh Dang & Grzegorz Bocewicz & Zbigniew Banaszak, 2017. "A methodology for implementation of mobile robot in adaptive manufacturing environments," Journal of Intelligent Manufacturing, Springer, vol. 28(5), pages 1171-1188, June.
    4. Izabela Nielsen & Quang-Vinh Dang & Grzegorz Bocewicz & Zbigniew Banaszak, 0. "A methodology for implementation of mobile robot in adaptive manufacturing environments," Journal of Intelligent Manufacturing, Springer, vol. 0, pages 1-18.
    5. Vyacheslav Chistyakov & Boris Goldengorin & Panos Pardalos, 2012. "Extremal values of global tolerances in combinatorial optimization with an additive objective function," Journal of Global Optimization, Springer, vol. 53(3), pages 475-495, July.
    6. Marcel Turkensteen & Dmitry Malyshev & Boris Goldengorin & Panos M. Pardalos, 2017. "The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems," Journal of Global Optimization, Springer, vol. 68(3), pages 601-622, July.
    7. Jamal Ouenniche & Prasanna K. Ramaswamy & Michel Gendreau, 2017. "A dual local search framework for combinatorial optimization problems with TSP application," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1377-1398, November.

  4. 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.

    Cited by:

    1. Liu, Yipeng & Koehler, Gary J., 2010. "Using modifications to Grover's Search algorithm for quantum global optimization," European Journal of Operational Research, Elsevier, vol. 207(2), pages 620-632, December.

  5. S Das & D Ghosh, 2003. "Binary knapsack problems with random budgets," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(9), pages 970-983, September.

    Cited by:

    1. João Claro & Jorge Sousa, 2010. "A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem," Computational Optimization and Applications, Springer, vol. 46(3), pages 427-450, July.

  6. 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.
    See citations under working paper version above.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

NEP Fields

NEP is an announcement service for new working papers, with a weekly report in each of many fields. This author has had 11 papers announced in NEP. These are the fields, ordered by number of announcements, along with their dates. If the author is listed in the directory of specialists for this field, a link is also provided.
  1. NEP-CMP: Computational Economics (6) 2015-01-03 2016-02-23 2016-03-23 2016-04-04 2016-04-09 2016-04-16. Author is listed
  2. NEP-CSE: Economics of Strategic Management (1) 2016-08-07
  3. NEP-GTH: Game Theory (1) 2016-08-07
  4. NEP-HPE: History & Philosophy of Economics (1) 2016-08-07
  5. NEP-MIC: Microeconomics (1) 2016-08-07
  6. NEP-ORE: Operations Research (1) 2016-04-16

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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.

IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.