#### Filter Results:

- Full text PDF available (12)

#### Publication Year

1989

2017

- This year (2)
- Last 5 years (4)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Rajeev Kohli, Ramesh Krishnamurti, Prakash Mirchandani
- SIAM J. Discrete Math.
- 1994

This paper shows that a minimization version of satisfiability is strongly NP-hard, even if each clause contains no more than two literals and/or each clause contains at most one unnegated variable. The worst-case and average-case performances of greedy and probabilistic greedy heuristics for the problem are examined, and tight upper bounds on the… (More)

- Rajeev Kohli, Kamel Jedidi
- 2007

T authors propose two variants of lexicographic preference rules. They obtain the necessary and sufficient conditions under which a linear utility function represents a standard lexicographic rule, and each of the proposed variants, over a set of discrete attributes. They then: (i) characterize the measurement properties of the parameters in the… (More)

- Rajeev Kohli, Donald R. Lehmann, Jae Pae
- 2006

This article examines the time between product development and market launch, and its relation to the subsequent diffusion of consumer durables. We find that this “incubation time” is long. Further, it is a useful predictor of the shape of the subsequent sales diffusion curve. Using the Bass model as a base, we find that the longer the incubation time, the… (More)

- Rajeev Kohli, Ramesh Krishnamurti
- SIAM J. Discrete Math.
- 1989

Distribution-free tight lower bounds on the average performance ratio for random search, for a greedy heuristic and for a probabilistic greedy heuristic are derived for an optimization version of satisfiability. On average, the random solution is never worse than ofthe optimal, regardless ofthe data-generating distribution. The lower bound on the average… (More)

- Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli
- Operations Research
- 2009

We extend a model by Bollapragada and Garbiras (2004) for scheduling commercial advertisements during breaks in television programming. The proposed extension allows differential weighting of conflicts between pairs of commercials. We formulate the problem as a capacitated generalization of the max k-cut problem in which the vertices of a graph correspond… (More)

- Rajeev Kohli, Raaj Sah
- Management Science
- 2006

- Rajeev Kohli, Ramesh Krishnamurti, Prakash Mirchandani
- European Journal of Operational Research
- 2004

This paper derives a lower bound on the average performance of a total-value greedy heuristic for the integer knapsack problem. This heuristic selects items in order of their maximum possible contribution to the solution value at each stage. We show that, as for the worst-case bound, the average performance bound for the total-value heuristic dominates the… (More)

- Narinder P Singh, Vaibhav Sahni, +4 authors Satish K Agarwal
- Hemodialysis international. International…
- 2006

Our aim is to study the effect of improvement in anemia on event-related potentials (ERPs; P300) as markers of cognitive dysfunction in predialysis and dialysis patients of chronic kidney disease (CKD). Thirty anemic patients of CKD (hemoglobin [Hb] < 9 g%), 15 in the predialysis group (Group A), and 15 patients on biweekly hemodialysis (Group B) were… (More)

- Rajeev Kohli, Ramesh Krishnamurti, Kamel Jedidi
- Discrete Applied Mathematics
- 2006

The objective of this study was to distinguish within a population of patients with and without breast cancer. The study was based on the University of Wisconsin’s dataset of 569 patients, of whom 212 were subsequently found to have breast cancer. A subset-conjunctive model, which is related to LogicalAnalysis of Data, is described to distinguish between… (More)

- Rajeev Kohli, Kamel Jedidi
- Operations Research
- 2015