Diptesh Ghosh : Citation Profile


Are you Diptesh Ghosh?

Indian Institute of Management Ahmedabad (IIMA)

6

H index

3

i10 index

126

Citations

RESEARCH PRODUCTION:

10

Articles

43

Papers

1

Books

10

Chapters

RESEARCH ACTIVITY:

   19 years (2000 - 2019). See details.
   Cites by year: 6
   Journals where Diptesh Ghosh has often published
   Relations with other researchers
   Recent citing documents: 2.    Total self citations: 16 (11.27 %)

MORE DETAILS IN:
ABOUT THIS REPORT:

   Permalink: http://citec.repec.org/pgh18
   Updated: 2024-04-18    RAS profile: 2021-04-01    
   Missing citations? Add them    Incorrect content? Let us know

Relations with other researchers


Works with:

Authors registered in RePEc who have co-authored more than one work in the last five years with Diptesh Ghosh.

Is cited by:

Chakravarty, Sujoy (2)

Goldengorin, Boris (1)

de Armas, Jésica (1)

Sarkar, Sumit (1)

Cites to:

Challet, Damien (8)

Peeters, Dominique (4)

Goldengorin, Boris (4)

Mitra, Manipushpak (2)

Beasley, John (2)

Goel, Anand (1)

Main data


Where Diptesh Ghosh has published?


Journals with more than one article published# docs
European Journal of Operational Research4

Working Papers Series with more than one paper published# docs
Research Report / University of Groningen, Research Institute SOM (Systems, Organisations and Management)10
Papers / arXiv.org2

Recent works citing Diptesh Ghosh (2024 and 2023)


YearTitle of citing document
2023Exact approaches for the combined cell layout problem. (2023). Fischer, Frank ; Dahlbeck, Mirko ; Maier, Kerstin ; Hungerlander, Philipp. In: European Journal of Operational Research. RePEc:eee:ejores:v:305:y:2023:i:2:p:530-546.

Full description at Econpapers || Download paper

2023Self-adaptive heuristic algorithms for the dynamic and stochastic orienteering problem in autonomous transportation system. (2023). Mansouri, MO ; Bian, Zheyong ; Wang, Bijun. In: Journal of Heuristics. RePEc:spr:joheur:v:29:y:2023:i:1:d:10.1007_s10732-022-09507-2.

Full description at Econpapers || Download paper

Works by Diptesh Ghosh:


YearTitleTypeCited
2016Self-organization in a distributed coordination game through heuristic rules In: Papers.
[Full Text][Citation analysis]
paper2
2016Self-organization in a distributed coordination game through heuristic rules.(2016) In: The European Physical Journal B: Condensed Matter and Complex Systems.
[Full Text][Citation analysis]
This paper has nother version. Agregated cites: 2
article
2017Emergence of Distributed Coordination in the Kolkata Paise Restaurant Problem with Finite Information In: Papers.
[Full Text][Citation analysis]
paper4
2017Emergence of distributed coordination in the Kolkata Paise Restaurant problem with finite information.(2017) In: Physica A: Statistical Mechanics and its Applications.
[Full Text][Citation analysis]
This paper has nother version. Agregated cites: 4
article
2003Neighborhood search heuristics for the uncapacitated facility location problem In: European Journal of Operational Research.
[Full Text][Citation analysis]
article29
2002Neighborhood Search Heuristicsfor the Uncapacitated Facility Location Problem.(2002) In: IIMA Working Papers.
[Citation analysis]
This paper has nother version. Agregated cites: 29
paper
2006Sensitivity analysis of a greedy heuristic for knapsack problems In: European Journal of Operational Research.
[Full Text][Citation analysis]
article1
2008Tolerance-based Branch and Bound algorithms for the ATSP In: European Journal of Operational Research.
[Full Text][Citation analysis]
article8
2013Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods In: European Journal of Operational Research.
[Full Text][Citation analysis]
article14
2012Tabu Search for the Single Row Facility Layout Problem Using Exhaustive 2-Opt and Insertion Neighborhoods.(2012) In: IIMA Working Papers.
[Full Text][Citation analysis]
This paper has nother version. Agregated cites: 14
paper
2016Incorporating gender and age in genetic algorithms to solve the indexing problem In: Working Papers.
[Full Text][Citation analysis]
paper0
2016Incorporating gender and age in genetic algorithms to solve the indexing problem.(2016) In: IIMA Working Papers.
[Full Text][Citation analysis]
This paper has nother version. Agregated cites: 0
paper
2012A Competitive Genetic Algorithm for Single Row Facility Layout In: Working Papers.
[Full Text][Citation analysis]
paper3
2012A Competitive Genetic Algorithm for Single Row Facility Layout.(2012) In: IIMA Working Papers.
[Full Text][Citation analysis]
This paper has nother version. Agregated cites: 3
paper
2000Sensitivity analysis of the greedy heuristic for binary knapsack problems In: Research Report.
[Full Text][Citation analysis]
paper0
2000Complexity of determining exact tolerances for min-max combinatorial optimization problems In: Research Report.
[Full Text][Citation analysis]
paper0
2000Discrete optimization problems with random cost elements In: Research Report.
[Full Text][Citation analysis]
paper0
2000On the complexity of determining tolerances for ->e--optimal solutions to min-max combinatorial optimization problems In: Research Report.
[Full Text][Citation analysis]
paper0
2000Complete local search with memory In: Research Report.
[Full Text][Citation analysis]
paper1
2000Equivalent instances of the simple plant location problem In: Research Report.
[Full Text][Citation analysis]
paper4
2001Branch and peg algorithms for the simple plant location problem In: Research Report.
[Full Text][Citation analysis]
paper9
2001The binary knapsack problem: solutions with guaranteed quality In: Research Report.
[Full Text][Citation analysis]
paper0
2004A Multilevel Search Algorithm for the Maximization of Submodular Functions In: Research Report.
[Full Text][Citation analysis]
paper1
2004Iterative Patching and the Asymmetric Traveling Salesman Problem In: Research Report.
[Full Text][Citation analysis]
paper2
2011An Exponential Neighborhood Local Search Algorithm for the Single Row Facility Location Problem In: IIMA Working Papers.
[Full Text][Citation analysis]
paper1
2011The Single Row Facility Layout Problem: State of the Art In: IIMA Working Papers.
[Full Text][Citation analysis]
paper3
2012On the Blowout Preventer Testing Problem: An Approach to Checking for Leakage in BOP Networks In: IIMA Working Papers.
[Full Text][Citation analysis]
paper0
2012A Lin-Kernighan Heuristic for Single Row Facility Layout In: IIMA Working Papers.
[Full Text][Citation analysis]
paper6
2012Tabu Search for the Single Row Facility Layout Problem in FMS using a 3-opt Neighborhood In: IIMA Working Papers.
[Full Text][Citation analysis]
paper0
2012Scatter Search Algorithms for the Single Row Facility Layout Problem In: IIMA Working Papers.
[Full Text][Citation analysis]
paper11
2012Sensitivity Analysis for the Single Row Facility Layout Problem In: IIMA Working Papers.
[Full Text][Citation analysis]
paper7
2012Path Relinking for Single Row Facility Layout In: IIMA Working Papers.
[Full Text][Citation analysis]
paper3
2012Population Heuristics for the Corridor Allocation Problem In: IIMA Working Papers.
[Full Text][Citation analysis]
paper5
2013Identifying defective valves in a blowout preventer valve network In: IIMA Working Papers.
[Full Text][Citation analysis]
paper0
2014Tabu Search for Multi-Period Facility Location: Uncapacitated Problem with an Uncertain Number of Servers In: IIMA Working Papers.
[Full Text][Citation analysis]
paper3
2015A Quadratic Programming Formulation of the Equidistant Bi-directional Loop Layout Problem In: IIMA Working Papers.
[Full Text][Citation analysis]
paper0
2016Allocating tools to index positions in tool magazines using tabu search In: IIMA Working Papers.
[Full Text][Citation analysis]
paper1
2016Exploring Lin Kernighan neighborhoods for the indexing problem In: IIMA Working Papers.
[Full Text][Citation analysis]
paper0
2016A new genetic algorithm for the tool indexing problem In: IIMA Working Papers.
[Full Text][Citation analysis]
paper1
2016Comparing Genetic Algorithm Crossover and Mutation Operators for the Indexing Problem In: IIMA Working Papers.
[Full Text][Citation analysis]
paper0
2016Speeding up neighborhood search for the tool indexing problem In: IIMA Working Papers.
[Citation analysis]
paper0
2011A Diversification Operator for Genetic Algorithms In: IIMA Working Papers.
[Full Text][Citation analysis]
paper0
2002Obtaining Near OptimalSolutions for the Binary Knapsack Problem In: IIMA Working Papers.
[Citation analysis]
paper0
2002Data Correcting: A Methodologyfor obtaining near-optimal solutions In: IIMA Working Papers.
[Citation analysis]
paper0
2002The Data-Correcting Algorithmfor the Maximization of Submodular functions: A Multilevel search in thehasse Diagram In: IIMA Working Papers.
[Citation analysis]
paper0
2003A Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem In: IIMA Working Papers.
[Full Text][Citation analysis]
paper1
2003Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems In: IIMA Working Papers.
[Full Text][Citation analysis]
paper1
2004Data Correcting Algorithms in Combinatorial Optimization In: IIMA Working Papers.
[Full Text][Citation analysis]
paper0
2006Spotting Difficult Weakly Correlated Binary Knapsack Problems In: IIMA Working Papers.
[Full Text][Citation analysis]
paper0
2003Binary knapsack problems with random budgets In: Journal of the Operational Research Society.
[Full Text][Citation analysis]
article2
2010The Modeling and Implementing Process In: International Series in Operations Research & Management Science.
[Citation analysis]
chapter0
2010Erratum In: International Series in Operations Research & Management Science.
[Citation analysis]
chapter0
2010Network Theory In: International Series in Operations Research & Management Science.
[Citation analysis]
chapter0
2010References with Comments In: International Series in Operations Research & Management Science.
[Citation analysis]
chapter0
2010Shortest Paths In: International Series in Operations Research & Management Science.
[Citation analysis]
chapter0
2010Minimum Spanning Trees In: International Series in Operations Research & Management Science.
[Citation analysis]
chapter0
2010Network Flows In: International Series in Operations Research & Management Science.
[Citation analysis]
chapter0
2010Matchings In: International Series in Operations Research & Management Science.
[Citation analysis]
chapter0
2010Facility Location In: International Series in Operations Research & Management Science.
[Citation analysis]
chapter0
2010Cyclic Routing on Networks In: International Series in Operations Research & Management Science.
[Citation analysis]
chapter0
2010Networks in Action In: International Series in Operations Research and Management Science.
[Citation analysis]
book0
2011Data aggregation for p-median problems In: Journal of Combinatorial Optimization.
[Full Text][Citation analysis]
article2
2019Emergence of anti-coordination through reinforcement learning in generalized minority games In: Journal of Economic Interaction and Coordination.
[Full Text][Citation analysis]
article1
2019Identifying defective network components through restricted group testing In: OPSEARCH.
[Full Text][Citation analysis]
article0

CitEc is a RePEc service, providing citation data for Economics since 2001. Sponsored by INOMICS. Last updated March, 4 2024. Contact: CitEc Team