Access Statistics for Diptesh Ghosh

Author contact details at EconPapers.

Working Paper File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
A Competitive Genetic Algorithm for Single Row Facility Layout 0 0 0 18 3 4 6 88
A Competitive Genetic Algorithm for Single Row Facility Layout 0 0 0 9 1 3 4 46
A Diversification Operator for Genetic Algorithms 0 0 0 18 1 2 4 80
A Lin-Kernighan Heuristic for Single Row Facility Layout 0 0 0 14 2 4 4 88
A Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem 0 0 0 28 1 2 2 110
A Quadratic Programming Formulation of the Equidistant Bi-directional Loop Layout Problem 0 0 0 11 4 4 8 30
A new genetic algorithm for the tool indexing problem 0 0 0 27 0 1 5 53
Allocating tools to index positions in tool magazines using tabu search 0 1 1 16 3 4 6 44
An Exponential Neighborhood Local Search Algorithm for the Single Row Facility Location Problem 0 0 0 10 0 0 2 64
Branch and peg algorithms for the simple plant location problem 0 0 0 1 2 2 2 23
Comparing Genetic Algorithm Crossover and Mutation Operators for the Indexing Problem 0 0 0 31 0 0 1 85
Complete local search with memory 0 0 0 1 1 2 4 20
Complexity of determining exact tolerances for min-max combinatorial optimization problems 0 0 0 0 1 3 4 19
Data Correcting Algorithms in Combinatorial Optimization 0 0 0 4 1 1 3 31
Data Correcting: A Methodologyfor obtaining near-optimal solutions 0 0 0 1 2 3 3 20
Discrete optimization problems with random cost elements 0 0 0 1 1 2 2 16
Emergence of Distributed Coordination in the Kolkata Paise Restaurant Problem with Finite Information 0 0 0 3 1 1 1 21
Equivalent instances of the simple plant location problem 0 0 0 4 1 2 4 26
Exploring Lin Kernighan neighborhoods for the indexing problem 0 0 0 21 1 2 6 61
Identifying defective valves in a blowout preventer valve network 0 0 0 5 2 3 4 27
Incorporating gender and age in genetic algorithms to solve the indexing problem 0 0 0 1 1 1 1 6
Incorporating gender and age in genetic algorithms to solve the indexing problem 0 0 0 27 2 5 6 34
Iterative Patching and the Asymmetric Traveling Salesman Problem 0 0 0 2 4 9 11 41
Neighborhood Search Heuristicsfor the Uncapacitated Facility Location Problem 0 0 0 1 5 7 9 108
Obtaining Near OptimalSolutions for the Binary Knapsack Problem 0 0 0 0 0 1 1 23
On the Blowout Preventer Testing Problem: An Approach to Checking for Leakage in BOP Networks 0 0 0 50 4 4 4 428
On the complexity of determining tolerances for ->e--optimal solutions to min-max combinatorial optimization problems 0 0 0 4 1 2 3 23
Path Relinking for Single Row Facility Layout 0 0 0 21 3 3 3 77
Population Heuristics for the Corridor Allocation Problem 0 2 3 53 2 5 10 177
Scatter Search Algorithms for the Single Row Facility Layout Problem 0 0 0 29 1 3 6 113
Self-organization in a distributed coordination game through heuristic rules 0 0 0 31 3 4 5 39
Sensitivity Analysis for the Single Row Facility Layout Problem 0 0 0 7 2 4 8 48
Sensitivity analysis of the greedy heuristic for binary knapsack problems 0 0 0 1 2 4 5 27
Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems 0 0 0 8 2 2 2 43
Speeding up neighborhood search for the tool indexing problem 0 0 0 3 3 4 10 58
Spotting Difficult Weakly Correlated Binary Knapsack Problems 0 0 3 21 0 2 12 87
Tabu Search for Multi-Period Facility Location: Uncapacitated Problem with an Uncertain Number of Servers 0 0 0 21 0 0 3 37
Tabu Search for the Single Row Facility Layout Problem Using Exhaustive 2-Opt and Insertion Neighborhoods 0 0 0 36 1 7 22 157
Tabu Search for the Single Row Facility Layout Problem in FMS using a 3-opt Neighborhood 0 0 0 12 0 1 1 76
The Data-Correcting Algorithmfor the Maximization of Submodular functions: A Multilevel search in thehasse Diagram 0 0 0 0 1 1 2 22
The Single Row Facility Layout Problem: State of the Art 1 1 1 55 5 8 11 218
The binary knapsack problem: solutions with guaranteed quality 0 0 0 3 4 6 8 43
A Multilevel Search Algorithm for the Maximization of Submodular Functions 0 0 0 0 2 4 4 25
Total Working Papers 1 4 8 609 76 132 222 2,862


Journal Article File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
Binary knapsack problems with random budgets 0 0 0 5 4 7 10 27
Data aggregation for p-median problems 0 0 0 1 4 5 9 13
Emergence of anti-coordination through reinforcement learning in generalized minority games 0 0 0 4 1 1 4 28
Emergence of distributed coordination in the Kolkata Paise Restaurant problem with finite information 0 0 0 1 4 5 6 18
Identifying defective network components through restricted group testing 0 0 0 3 3 3 3 16
Neighborhood search heuristics for the uncapacitated facility location problem 0 1 3 49 3 4 8 201
Self-organization in a distributed coordination game through heuristic rules 0 0 0 0 0 2 6 15
Sensitivity analysis of a greedy heuristic for knapsack problems 0 0 0 11 1 1 2 36
Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods 0 0 0 16 1 7 12 155
Tolerance-based Branch and Bound algorithms for the ATSP 0 0 0 32 2 3 4 128
Total Journal Articles 0 1 3 122 23 38 64 637


Book File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
Networks in Action 0 0 0 0 4 4 8 15
Total Books 0 0 0 0 4 4 8 15


Chapter File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
Cyclic Routing on Networks 0 0 0 0 1 1 1 2
Erratum 0 0 0 0 3 3 3 3
Facility Location 0 0 0 0 1 1 2 7
Matchings 0 0 0 0 0 2 4 24
Minimum Spanning Trees 0 0 0 0 1 3 4 11
Network Flows 0 0 0 0 2 2 2 2
Network Theory 0 0 0 0 1 3 4 8
References with Comments 0 0 0 0 1 2 3 5
Shortest Paths 0 0 0 0 2 2 3 6
The Modeling and Implementing Process 0 0 0 0 1 1 1 5
Total Chapters 0 0 0 0 13 20 27 73


Statistics updated 2026-02-12