Details about Diptesh Ghosh

Access statistics for papers by Diptesh Ghosh.

Last updated 2021-04-01. Update your information in the RePEc Author Service.

Short-id: pgh18

Working Papers

2017

1. Emergence of Distributed Coordination in the Kolkata Paise Restaurant Problem with Finite Information
   Papers, arXiv.org View citations (5)
   See also Journal Article Emergence of distributed coordination in the Kolkata Paise Restaurant problem with finite information, Physica A: Statistical Mechanics and its Applications, Elsevier (2017) View citations (5) (2017)

2016

2. A new genetic algorithm for the tool indexing problem
   IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department View citations (2)
3. Allocating tools to index positions in tool magazines using tabu search
   IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department View citations (4)
4. Comparing Genetic Algorithm Crossover and Mutation Operators for the Indexing Problem
   IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department
5. Exploring Lin Kernighan neighborhoods for the indexing problem
   IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department View citations (1)
6. Incorporating gender and age in genetic algorithms to solve the indexing problem
   IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department
   Also in Working Papers, eSocialSciences (2016)
7. Self-organization in a distributed coordination game through heuristic rules
   Papers, arXiv.org View citations (2)
   See also Journal Article Self-organization in a distributed coordination game through heuristic rules, The European Physical Journal B: Condensed Matter and Complex Systems, Springer (2016) View citations (2) (2016)
8. Speeding up neighborhood search for the tool indexing problem
   IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department

2015

9. A Quadratic Programming Formulation of the Equidistant Bi-directional Loop Layout Problem
   IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department

2014

10. Tabu Search for Multi-Period Facility Location: Uncapacitated Problem with an Uncertain Number of Servers
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department View citations (3)

2013

11. Identifying defective valves in a blowout preventer valve network
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department

2012

12. A Competitive Genetic Algorithm for Single Row Facility Layout
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department View citations (3)
    Also in Working Papers, eSocialSciences (2012) View citations (4)
13. A Lin-Kernighan Heuristic for Single Row Facility Layout
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department View citations (10)
14. On the Blowout Preventer Testing Problem: An Approach to Checking for Leakage in BOP Networks
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department View citations (1)
15. Path Relinking for Single Row Facility Layout
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department View citations (3)
16. Population Heuristics for the Corridor Allocation Problem
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department View citations (6)
17. Scatter Search Algorithms for the Single Row Facility Layout Problem
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department View citations (12)
18. Sensitivity Analysis for the Single Row Facility Layout Problem
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department View citations (7)
19. Tabu Search for the Single Row Facility Layout Problem Using Exhaustive 2-Opt and Insertion Neighborhoods
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department View citations (4)
    See also Journal Article Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods, European Journal of Operational Research, Elsevier (2013) View citations (21) (2013)
20. Tabu Search for the Single Row Facility Layout Problem in FMS using a 3-opt Neighborhood
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department

2011

21. A Diversification Operator for Genetic Algorithms
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department View citations (2)
22. An Exponential Neighborhood Local Search Algorithm for the Single Row Facility Location Problem
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department View citations (1)
23. The Single Row Facility Layout Problem: State of the Art
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department View citations (7)

2006

24. Spotting Difficult Weakly Correlated Binary Knapsack Problems
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department

2004

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

2003

28. A Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department View citations (1)
29. Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department View citations (1)

2002

30. Data Correcting: A Methodologyfor obtaining near-optimal solutions
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department
31. Neighborhood Search Heuristicsfor the Uncapacitated Facility Location Problem
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department
    See also Journal Article Neighborhood search heuristics for the uncapacitated facility location problem, European Journal of Operational Research, Elsevier (2003) View citations (29) (2003)
32. Obtaining Near OptimalSolutions for the Binary Knapsack Problem
    IIMA Working Papers, Indian Institute of Management Ahmedabad, Research and Publication Department
33. 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

34. Branch and peg algorithms for the simple plant location problem
    Research Report, University of Groningen, Research Institute SOM (Systems, Organisations and Management) View citations (8)
35. The binary knapsack problem: solutions with guaranteed quality
    Research Report, University of Groningen, Research Institute SOM (Systems, Organisations and Management)

2000

36. Complete local search with memory
    Research Report, University of Groningen, Research Institute SOM (Systems, Organisations and Management) View citations (1)
37. Complexity of determining exact tolerances for min-max combinatorial optimization problems
    Research Report, University of Groningen, Research Institute SOM (Systems, Organisations and Management)
38. Discrete optimization problems with random cost elements
    Research Report, University of Groningen, Research Institute SOM (Systems, Organisations and Management) View citations (1)
39. Equivalent instances of the simple plant location problem
    Research Report, University of Groningen, Research Institute SOM (Systems, Organisations and Management) View citations (5)
40. 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)
41. Sensitivity analysis of the greedy heuristic for binary knapsack problems
    Research Report, University of Groningen, Research Institute SOM (Systems, Organisations and Management)

Journal Articles

2019

1. Emergence of anti-coordination through reinforcement learning in generalized minority games
   Journal of Economic Interaction and Coordination, 2019, 14, (2), 225-245 View citations (1)
2. Identifying defective network components through restricted group testing
   OPSEARCH, 2019, 56, (3), 869-889

2017

3. Emergence of distributed coordination in the Kolkata Paise Restaurant problem with finite information
   Physica A: Statistical Mechanics and its Applications, 2017, 483, (C), 16-24 View citations (5)
   See also Working Paper Emergence of Distributed Coordination in the Kolkata Paise Restaurant Problem with Finite Information, Papers (2017) View citations (5) (2017)

2016

4. Self-organization in a distributed coordination game through heuristic rules
   The European Physical Journal B: Condensed Matter and Complex Systems, 2016, 89, (12), 1-10 View citations (2)
   See also Working Paper Self-organization in a distributed coordination game through heuristic rules, Papers (2016) View citations (2) (2016)

2013

5. Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
   European Journal of Operational Research, 2013, 224, (1), 93-100 View citations (21)
   See also Working Paper Tabu Search for the Single Row Facility Layout Problem Using Exhaustive 2-Opt and Insertion Neighborhoods, IIMA Working Papers (2012) View citations (4) (2012)

2011

6. Data aggregation for p-median problems
   Journal of Combinatorial Optimization, 2011, 21, (3), 348-363 View citations (2)

2008

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

2006

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

2003

9. Binary knapsack problems with random budgets
   Journal of the Operational Research Society, 2003, 54, (9), 970-983 View citations (2)
10. Neighborhood search heuristics for the uncapacitated facility location problem
    European Journal of Operational Research, 2003, 150, (1), 150-162 View citations (29)
    See also Working Paper Neighborhood Search Heuristicsfor the Uncapacitated Facility Location Problem, IIMA Working Papers (2002) (2002)

Books

2010

1. Networks in Action
   International Series in Operations Research and Management Science, Springer

Chapters

2010

1. Cyclic Routing on Networks
   Springer
2. Erratum
   Springer
3. Facility Location
   Springer
4. Matchings
   Springer
5. Minimum Spanning Trees
   Springer
6. Network Flows
   Springer
7. Network Theory
   Springer
8. References with Comments
   Springer
9. Shortest Paths
   Springer
10. The Modeling and Implementing Process
    Springer