Tolerance-based greedy algorithms for the traveling salesman problem. (2007)
Ghosh, D., Goldengorin, B., Gutin, G., Jaeger, G.
In this paper we introduce three greedy algorithms for the traveling salesman problem. These algorithms are unique in that they use arc tolerances, rather than arc weights, to decide whether or not...
Human defensin 5 expression in intestinal metaplasia of the upper gastrointestinal tract (2005)
Shen, B, Porter, E M, Reynoso, E, Shen, C, Ghosh, D, Connor, J T, ...
Background: Upper gastrointestinal tract intestinal metaplasia (IM) is termed Barrett's oesophagus (BO) or gastric intestinal metaplasia (GIM), depending on its location. BO and GIM are associated...
Sensitivity analysis of the greedy heuristic for binary knapsack problems (2000)
Ghosh, D., Chakravarti, N., Sierksma, G.
Greedy heuristics are a popular choice of heuristics when we have to solve a large variety of NP -hard combinatorial problems. In particular for binary knapsack problems, these heuristics generate...
Complexity of determining exact tolerances for min-max combinatorial optimization problems (2000)
Ramaswamy, R., Chakravarti, N., Ghosh, D.
Suppose that we are given an instance of a combinatorial optimization problemwith min-max objective along with an optimal solution for it. Let the cost of asingle element be varied. We refer to the...
Sensitivity analysis of e-optimal solutions is the problem of calculating the range within which a problem parameter may lie so that the given solution re-mains e-optimal. In this paper we study the...
Discrete optimization problems with random cost elements (2000)
In a general class of discrete optimization problems, some of the elements mayhave random costs associated with them. In such a situation, the notion of optimalityneeds to be suitably modified. In...
Complete local search with memory (2000)
Abstract Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart from tabu...
Equivalent instances of the simple plant location problem (2000)
Goldengorin, B., Ghosh, D., Sierksma, G.
In this paper we deal with a pseudo-Boolean representation of the simple plant location problem. We define instances of this problem that are equivalent, in the sense that each feasible solution has...
Bhattacharyya, S., Ghosh, D., Mukhopadhyay, S., Jensen, W. P., Tiekink, Edward Richard Tom, Chaudhury, M.
Bhattacharyya, S., Ghosh, D., Mukhopadhyay, S., Jensen, W. P., Tiekink, Edward Richard Tom, Chaudhury, M.
On some vector valued sequence space using Orlicz function (1999)
In this paper, we introduced some new sequence space using Orlicz function and study some properties of this space. http://web.math.hr/glasnik/vol_34/no2_12.html
A large database which incorporates every possible variations, is required for training/testing of any handwritten character recognition system. Collecting natural samples is not convenient in many...
Some initialization problems in clustering and their remedies (1998)
In this paper, we propose a new algorithm for clustering a set of given feature vectors. The algorithm provides a scheme for transition from fuzzy clustering mode to crisp decision based clustering...
Fast codeword search algorithm for real-time codebook generation in adaptive VQ (1997)
Adaptive vector quantisation is used in image sequence coding where the code-book is updated continuously to keep track with the changing source statistics. Hence, for real-time video coding...
Synchrotron X-ray and a four-circle diffractometer were used to study the room temperature incommensurate phase in stage-2 graphite-bromine prepared with single crystal graphite in bromine liquid....
Synchrotron X-ray and a four-circle diffractometer were used to study the room temperature incommensurate phase in stage-2 graphite-bromine prepared with single crystal graphite in bromine liquid....
Synchrotron X-ray and a four-circle diffractometer were used to study the room temperature incommensurate phase in stage-2 graphite-bromine prepared with single crystal graphite in bromine liquid....
Sensitivity analysis of the greedy heuristic for binary knapsack problems
Ghosh, D., Chakravarti, N., Sierksma, G.
Greedy heuristics are a popular choice of heuristics when we have to solve a large variety of NP -hard combinatorial problems. In particular for binary knapsack problems, these heuristics generate...
Complexity of determining exact tolerances for min-max combinatorial optimization problems
Ramaswamy, R., Chakravarti, N., Ghosh, D.
Suppose that we are given an instance of a combinatorial optimization problemwith min-max objective along with an optimal solution for it. Let the cost of asingle element be varied. We refer to the...
Discrete optimization problems with random cost elements
In a general class of discrete optimization problems, some of the elements mayhave random costs associated with them. In such a situation, the notion of optimalityneeds to be suitably modified. In...
Sensitivity analysis of e-optimal solutions is the problem of calculating the range within which a problem parameter may lie so that the given solution re-mains e-optimal. In this paper we study the...
Complete local search with memory
Abstract Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart from tabu...
Equivalent instances of the simple plant location problem
Goldengorin, B., Ghosh, D., Sierksma, G.
In this paper we deal with a pseudo-Boolean representation of the simple plant location problem. We define instances of this problem that are equivalent, in the sense that each feasible solution has...
Bid-ask Spreads, Trading Volume and Volatility: Intra-day Evidence from the London Stock Exchange
A. Abhyankar, D. Ghosh, E. Levin, R.J. Limmack
This paper examines intra-day variations in the bid-ask spread, volatility and volume for stocks traded on the London Stock Exchange. The data set used consists of quote and transactions data for a...
Human defensin 5 expression in intestinal metaplasia of the upper gastrointestinal tract
Shen, B, Porter, E M, Reynoso, E, Shen, C, Ghosh, D, Connor, J T, ...
Background: Upper gastrointestinal tract intestinal metaplasia (IM) is termed Barrett’s oesophagus (BO) or gastric intestinal metaplasia (GIM), depending on its location. BO and GIM are associated...