Browsing Faculty Publications (Bibliographic) by Author "Ghosh, Diptesh"
Now showing items 1-20 of 33
-
Analysis of the Behaviour of Optimal Solutions to Combinatorial Optimization Problems When Element Costs Vary
Ghosh, Diptesh; Das, Shubhabrata (2010-06-07) -
Binary knapsack problems with random budgets
Das, Shubhabrata; Ghosh, Diptesh (2003-10-21)The binary knapsack problem is a combinatorial optimization problem in which a subset of a given set of elements needs to be chosen in order to maximize profit, given a budget constraint. In this paper, we study a stochastic ... -
Branch and peg algorithms for the simple plant location problems
Goldengorin, B.; Ghosh, Diptesh; Sierksma, G. (2003-10-20)The simple plant location problem is a well-studied problem in combinatorial optimization. It is one of deciding where to locate a set of plants so that a set of clients can be supplied by them at the minimum cost. This ... -
Complete local search with memory
Ghosh, Diptesh; Sierksma, G. (2002-10-20) -
Data Correcting Algorithms in Combinatorial Optimization
Ghosh, Diptesh; Goldengorin, Boris; Sierksma, Gerard (2010-11-12) -
Data Correcting: A Methodology for Obtaining Near Optimal Solutions
Ghosh, Diptesh; Goldengorin, Boris; Sierksma, Gerard (2010-07-07) -
Discrete optimization: tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
Kothari, R.; Ghosh, Diptesh (European Journal of Operational Research, 2013)The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard. ... -
A diversification operator for genetic algorithms
Ghosh, Diptesh (Springer, 2012)Conventional genetic algorithms suffer from a dependence on the initial generation used by the algorithm. In case the generation consists of solutions which are not close enough to a global optimum but some of which are ... -
An efficient genetic algorithm for single row facility layout
Kothari, Ravi; Ghosh, Diptesh (Optimization Letters, 2014)The single row facility layout is the NP-Hard problem of arranging facilities with given lengths on a line, so as to minimize the weighted sum of the distances between all pairs of facilities. Owing to its computational ... -
Emergence of anti-coordination through reinforcement learning in generalized minority games
Chakrabarti, Anindya; Ghosh, Diptesh (Springer, 2017)In this paper we propose adaptive strategies to solve coordination failuresin a prototype generalized minority game model with a multi-agent, multi-choiceenvironment. We illustrate the model with an application to large ... -
Emergence of distributed coordination in the Kolkata Paise Restaurant problem with finite information
Ghosh, Diptesh; Chakrabarti, Anindya (Elseveir, 2017)In this paper, we study a large-scale distributed coordination problem and propose efficient adaptive strategies to solve the problem. The basic problem is to allocate finite number of resources to individual agents in the ... -
Identifying defective network components through restricted group testing
Ghosh, Diptesh (OPSEARCH, 2019)In this paper, we consider a network of switches in which some of the switches may malfunction. Our aim is to fnd out efciently (a) if any of the switches in a network of switches are defective, and (b) if there are defective ... -
Improving server utilization in a distributed computing set-up with independent clients
Chakrabarti, Anindya; Ghosh, Diptesh (2018)We consider a set-up in which there are multiple servers and multiple clients in a large distributed computing system. Clients request servers to process jobs. Servers can only process one job in unit time. There is no ... -
Insertion based lin-kernighan heuristic for single row facility layout
Kothari, R.; Ghosh, Diptesh (Elsevier Ltd, 2013)The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is known ... -
Integer Programming
Ghosh, Diptesh; Ravindra, G. S. (2010-08-31) -
Iterative patching and the asymmetric travelling salesman problem
Turkensteen, M.; Ghosh, Diptesh; Goldengorin, Boris; Sierksma, Gerard (2006-10-28) -
Large Point Source (LPS) emissions from India: regional and sectoral analysis, atmospheric environment
Garg, Amit; Kapshe, M.; Shukla, P. R.; Ghosh, Diptesh (2001-10-18)Indian large point sources (LPS) contribute to CO2 andSO2 emissions to a large extent (above 65%) andto CH4, N2O andNOX emissions to some extent (around10%). The former emissions are primarily from fossil fuel combustion while ... -
A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem
Goldengorin, Boris; Ghosh, Diptesh (2005-10-27)Maximization of submodular functions on a ground set is a NP-hard combinatorial optimization problem. Data correcting algorithms are among the several algorithms suggested for solving this problem exactly and approximately. ... -
Neighbourhood search heuristics for the uncapacitated facility location problem
Ghosh, Diptesh (2003-10-22)The uncapacitated facility location problem is one of choosing sites among a set of candidates in which facilities can be located, so that the demands of a given set of clients are satisfied at minimum costs. Applications ... -
Networks in Action: Computer Exercises in Network Optimization
Sierksma, G.; Ghosh, Diptesh (Springer, 2011-01-12)Most books covering network optimization explain the theory but offer only exercises that support the understanding of that theory, and case studies that are offered are not suitable for classroom analysis, either because ...