Browsing Faculty Publications (Bibliographic) by Author "Ghosh, Diptesh"
Now showing items 21-33 of 33
-
On Duality and Sensitivity Analysis
Ghosh, Diptesh; Ravindra, G. S. (2010-08-31)This note introduces concepts in duality and sensivity analysis. It does not presupposs knowledge linear algebra or the simplex method. -
On the complexity of determining tolerances for epsilon-optimal solutions to min-max combinatorial optimization problem
Ghosh, Diptesh; Sierksma, G. (2003-10-22) -
Renewable Energy Strategies for Indian Power Sector
Ghosh, Diptesh; Garg, Amit; Shukla, P. R.; Ramana, P. V. (2010-06-04) -
Renewable energy technologies for the Indian power sector: mitigation potential and operational strategies
Ghosh, Diptesh; Shukla, P. R.; Garg, Amit; Ramana, P. V. (2002-10-20) -
Sampling and Centralizing Tendencies
Ghosh, Diptesh; Ravindra, G. S. (2010-08-31)This note addresses sampling concepts introduced in a formulaic manner in managerial statistics textbooks like Anderson et. al. [ASW02] or Levin et. al. [LR97] that are used in Quantitative Methods III course. Students ... -
A scatter search algorithm for the single row facility layout problem
Kothari, Ravi; Ghosh, Diptesh (Springer, 2014)The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, with the objective of minimizing the weighted sum of the distances between all pairs of facilities. The ... -
Self-organization in a distributed coordination game through heuristic rules
Agarwal, Shubham; Ghosh, Diptesh; Chakrabarti, Anindya (Springer, 2016)In this paper, we consider a distributed coordination game played by a large number of agents with finite information sets, which characterizes emergence of a single dominant attribute out of a large number of competitors. ... -
Sensitivity analysis of the greedy heuristic for binary knapsack problems
Ghosh, Diptesh; Chakravarti, N.; Sierksma, Gerard (2006-10-27)Greedy heuristics are a popular choice of heuristics when we have to solve a large variety of N P-hard combinatorial problems. In particular for binary knapsack problems, these heuristics generate good results. If some ... -
The single row facility layout problem: state of the art
Kothari, R.; Ghosh, Diptesh (Springer, 2012-05-20)The single row facility layout problem (SRFLP) is a NP-hard problem concerned with the arrangement of facilities of given lengths on a line so as to minimize the weighted sum of the distances between all the pairs of ... -
Solving the simple plant location problem using a data correcting approach
Goldengorin, B.; Tijssen, G. A.; Ghosh, Diptesh; Sierksma, G. (2003-10-20)The Data Correcting Algorithm is a branch and bound type algorithm in which the data of a given problem instance is ‘corrected’ at each branching in such a way that the new instance will be as close as possible to a ... -
Stratified Sampling Under a Tight Budget
Ghosh, Diptesh; Ravindra, G. S. (2010-08-31)This note addresses stratified sampling concepts introduced in a formulaic manner in managerial statistics textbooks like Anderson et al. [ASW02] or Levin et al. [LR97] that are used in Quantitative Methods III course. The ... -
Tolerance -based Branch and Bound Algorithms
Turkensteen, M.; Ghosh, Diptesh; Goldengorin, Boris; Sierksma, Gerard (2010-11-12) -
Tolerance-based branch and bound algorithms for the ATSP
Turkensteen, M.; Ghosh, Diptesh; Goldengorin, B.; Sierksma, G. (2008-11-09)The selection of entries to be included/excluded in Branch and Bound algorithms is usually done on the basis of cost values. We consider the class of Depth First Search algorithms, and we propose to use upper tolerances ...