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 Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem 1 2 6 388 5 14 45 1,253
A review of the Tabu Search Literature on Traveling Salesman Problems 8 24 62 62 13 54 139 139
An empirical investigation into randomly generated Euclidean symmetric traveling salesman problems 1 2 5 19 3 8 25 99
Branch and peg algorithms for the simple plant location problem 0 0 5 64 0 1 13 246
Complete local search with memory 0 2 3 56 1 3 8 172
Complexity of determining exact tolerances for min-max combinatorial optimization problems 0 0 1 54 1 2 17 241
Data Correcting Algorithms in Combinatorial Optimization 0 0 3 32 1 1 7 117
Data Correcting: A Methodologyfor obtaining near-optimal solutions 0 0 0 0 0 0 2 88
Discrete optimization problems with random cost elements 0 1 3 50 1 8 23 323
Equivalent instances of the simple plant location problem 2 3 9 55 3 10 28 217
Implementing Tabu Search to Exploit Sparsity in ATSP Instances 6 26 56 56 15 61 127 127
Iterative Patching and the Asymmetric Traveling Salesman Problem 1 5 11 30 5 18 47 144
Neighborhood Search Heuristicsfor the Uncapacitated Facility Location Problem 0 0 0 1 5 12 62 337
Obtaining Near OptimalSolutions for the Binary Knapsack Problem 0 0 0 0 1 2 9 235
On the complexity of determining tolerances for ->e--optimal solutions to min-max combinatorial optimization problems 0 0 2 23 2 3 19 117
Sensitivity analysis of the greedy heuristic for binary knapsack problems 0 1 9 192 1 12 41 704
Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems 2 2 5 85 4 6 28 379
Solving the simple plant location problem using a data correcting approach 0 1 7 79 6 13 30 339
Spotting Difficult Weakly Correlated Binary Knapsack Problems 1 4 7 52 3 15 47 243
The Data-Correcting Algorithmfor the Maximization of Submodular functions: A Multilevel search in thehasse Diagram 0 0 0 0 0 0 1 81
The binary knapsack problem: solutions with guaranteed quality 5 22 83 360 31 110 322 1,301
A Multilevel Search Algorithm for the Maximization of Submodular Functions 0 0 1 23 0 1 10 130
Total Working Papers 27 95 278 1,681 101 354 1,050 7,032

Journal Article File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
Neighborhood search heuristics for the uncapacitated facility location problem 4 5 13 23 5 10 49 76
On the probability of extinction of a Galton-Watson process 0 0 1 1 1 3 9 9
Sensitivity analysis of a greedy heuristic for knapsack problems 0 0 7 8 0 0 17 25
Tolerance-based Branch and Bound algorithms for the ATSP 1 1 13 13 1 6 37 38
Total Journal Articles 5 6 34 45 7 19 112 148

logo

LogEc Home

Top Working Papers
Top Journal Articles
Top Books
Top Chapters
Top Software Items

Top Authors

Top Working Paper series and Journals

About LogEc

Authors with papers registered in the RePEc Author Service.

Register yourself as an author or register more papers in the RePEc Author Service.

Authors with no registered papers

RePEc
LogEc provides access and usage for services based on the RePEc data set.

Örebro UniversityLogEc is hosted by the Swedish Business School at Örebro University.

Questions or comments? Please see our explanation of how the statistics are collected or e-mail

Statistics updated 2009-07-03