6
H index
3
i10 index
126
Citations
Diptesh Ghosh : Citation Profile
Indian Institute of Management Ahmedabad (IIMA) | RESEARCH PRODUCTION: 10 Articles 43 Papers 1 Books 10 Chapters RESEARCH ACTIVITY:
MORE DETAILS IN: ABOUT THIS REPORT:
|
19 years (2000 - 2019). 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:
| Cites to:
|
Main data
Where Diptesh Ghosh has published?
| Journals with more than one article published | # docs |
|---|---|
| European Journal of Operational Research | 4 |
| 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.org | 2 |
Recent works citing Diptesh Ghosh (2024 and 2023)
| Year | Title of citing document |
|---|---|
| 2023 | Exact 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 |
| 2023 | Self-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:
| Year | Title | Type | Cited |
|---|---|---|---|
| 2016 | Self-organization in a distributed coordination game through heuristic rules In: Papers. [Full Text][Citation analysis] | paper | 2 |
| 2016 | Self-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 | |
| 2017 | Emergence of Distributed Coordination in the Kolkata Paise Restaurant Problem with Finite Information In: Papers. [Full Text][Citation analysis] | paper | 4 |
| 2017 | Emergence 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 | |
| 2003 | Neighborhood search heuristics for the uncapacitated facility location problem In: European Journal of Operational Research. [Full Text][Citation analysis] | article | 29 |
| 2002 | Neighborhood Search Heuristicsfor the Uncapacitated Facility Location Problem.(2002) In: IIMA Working Papers. [Citation analysis] This paper has nother version. Agregated cites: 29 | paper | |
| 2006 | Sensitivity analysis of a greedy heuristic for knapsack problems In: European Journal of Operational Research. [Full Text][Citation analysis] | article | 1 |
| 2008 | Tolerance-based Branch and Bound algorithms for the ATSP In: European Journal of Operational Research. [Full Text][Citation analysis] | article | 8 |
| 2013 | Tabu 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] | article | 14 |
| 2012 | Tabu 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 | |
| 2016 | Incorporating gender and age in genetic algorithms to solve the indexing problem In: Working Papers. [Full Text][Citation analysis] | paper | 0 |
| 2016 | Incorporating 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 | |
| 2012 | A Competitive Genetic Algorithm for Single Row Facility Layout In: Working Papers. [Full Text][Citation analysis] | paper | 3 |
| 2012 | A 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 | |
| 2000 | Sensitivity analysis of the greedy heuristic for binary knapsack problems In: Research Report. [Full Text][Citation analysis] | paper | 0 |
| 2000 | Complexity of determining exact tolerances for min-max combinatorial optimization problems In: Research Report. [Full Text][Citation analysis] | paper | 0 |
| 2000 | Discrete optimization problems with random cost elements In: Research Report. [Full Text][Citation analysis] | paper | 0 |
| 2000 | On the complexity of determining tolerances for ->e--optimal solutions to min-max combinatorial optimization problems In: Research Report. [Full Text][Citation analysis] | paper | 0 |
| 2000 | Complete local search with memory In: Research Report. [Full Text][Citation analysis] | paper | 1 |
| 2000 | Equivalent instances of the simple plant location problem In: Research Report. [Full Text][Citation analysis] | paper | 4 |
| 2001 | Branch and peg algorithms for the simple plant location problem In: Research Report. [Full Text][Citation analysis] | paper | 9 |
| 2001 | The binary knapsack problem: solutions with guaranteed quality In: Research Report. [Full Text][Citation analysis] | paper | 0 |
| 2004 | A Multilevel Search Algorithm for the Maximization of Submodular Functions In: Research Report. [Full Text][Citation analysis] | paper | 1 |
| 2004 | Iterative Patching and the Asymmetric Traveling Salesman Problem In: Research Report. [Full Text][Citation analysis] | paper | 2 |
| 2011 | An Exponential Neighborhood Local Search Algorithm for the Single Row Facility Location Problem In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 1 |
| 2011 | The Single Row Facility Layout Problem: State of the Art In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 3 |
| 2012 | On the Blowout Preventer Testing Problem: An Approach to Checking for Leakage in BOP Networks In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 0 |
| 2012 | A Lin-Kernighan Heuristic for Single Row Facility Layout In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 6 |
| 2012 | Tabu Search for the Single Row Facility Layout Problem in FMS using a 3-opt Neighborhood In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 0 |
| 2012 | Scatter Search Algorithms for the Single Row Facility Layout Problem In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 11 |
| 2012 | Sensitivity Analysis for the Single Row Facility Layout Problem In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 7 |
| 2012 | Path Relinking for Single Row Facility Layout In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 3 |
| 2012 | Population Heuristics for the Corridor Allocation Problem In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 5 |
| 2013 | Identifying defective valves in a blowout preventer valve network In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 0 |
| 2014 | Tabu Search for Multi-Period Facility Location: Uncapacitated Problem with an Uncertain Number of Servers In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 3 |
| 2015 | A Quadratic Programming Formulation of the Equidistant Bi-directional Loop Layout Problem In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 0 |
| 2016 | Allocating tools to index positions in tool magazines using tabu search In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 1 |
| 2016 | Exploring Lin Kernighan neighborhoods for the indexing problem In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 0 |
| 2016 | A new genetic algorithm for the tool indexing problem In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 1 |
| 2016 | Comparing Genetic Algorithm Crossover and Mutation Operators for the Indexing Problem In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 0 |
| 2016 | Speeding up neighborhood search for the tool indexing problem In: IIMA Working Papers. [Citation analysis] | paper | 0 |
| 2011 | A Diversification Operator for Genetic Algorithms In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 0 |
| 2002 | Obtaining Near OptimalSolutions for the Binary Knapsack Problem In: IIMA Working Papers. [Citation analysis] | paper | 0 |
| 2002 | Data Correcting: A Methodologyfor obtaining near-optimal solutions In: IIMA Working Papers. [Citation analysis] | paper | 0 |
| 2002 | The Data-Correcting Algorithmfor the Maximization of Submodular functions: A Multilevel search in thehasse Diagram In: IIMA Working Papers. [Citation analysis] | paper | 0 |
| 2003 | A Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 1 |
| 2003 | Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 1 |
| 2004 | Data Correcting Algorithms in Combinatorial Optimization In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 0 |
| 2006 | Spotting Difficult Weakly Correlated Binary Knapsack Problems In: IIMA Working Papers. [Full Text][Citation analysis] | paper | 0 |
| 2003 | Binary knapsack problems with random budgets In: Journal of the Operational Research Society. [Full Text][Citation analysis] | article | 2 |
| 2010 | The Modeling and Implementing Process In: International Series in Operations Research & Management Science. [Citation analysis] | chapter | 0 |
| 2010 | Erratum In: International Series in Operations Research & Management Science. [Citation analysis] | chapter | 0 |
| 2010 | Network Theory In: International Series in Operations Research & Management Science. [Citation analysis] | chapter | 0 |
| 2010 | References with Comments In: International Series in Operations Research & Management Science. [Citation analysis] | chapter | 0 |
| 2010 | Shortest Paths In: International Series in Operations Research & Management Science. [Citation analysis] | chapter | 0 |
| 2010 | Minimum Spanning Trees In: International Series in Operations Research & Management Science. [Citation analysis] | chapter | 0 |
| 2010 | Network Flows In: International Series in Operations Research & Management Science. [Citation analysis] | chapter | 0 |
| 2010 | Matchings In: International Series in Operations Research & Management Science. [Citation analysis] | chapter | 0 |
| 2010 | Facility Location In: International Series in Operations Research & Management Science. [Citation analysis] | chapter | 0 |
| 2010 | Cyclic Routing on Networks In: International Series in Operations Research & Management Science. [Citation analysis] | chapter | 0 |
| 2010 | Networks in Action In: International Series in Operations Research and Management Science. [Citation analysis] | book | 0 |
| 2011 | Data aggregation for p-median problems In: Journal of Combinatorial Optimization. [Full Text][Citation analysis] | article | 2 |
| 2019 | Emergence of anti-coordination through reinforcement learning in generalized minority games In: Journal of Economic Interaction and Coordination. [Full Text][Citation analysis] | article | 1 |
| 2019 | Identifying defective network components through restricted group testing In: OPSEARCH. [Full Text][Citation analysis] | article | 0 |
CitEc is a RePEc service, providing citation data for Economics since 2001. Sponsored by INOMICS. Last updated December, 10 2023. Contact: CitEc Team