Rajeev Kohli

Orcid: 0000-0003-3466-8028

According to our database1, Rajeev Kohli authored at least 21 papers between 1989 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Sequential choice in ordered bundles.
CoRR, 2024

2019
Randomized Algorithms for Lexicographic Inference.
Oper. Res., 2019

2017
Relation Between EBA and Nested Logit Models.
Oper. Res., 2017

2015
Error Theory for Elimination by Aspects.
Oper. Res., 2015

Lower Bound for the Unique Games Problem.
CoRR, 2015

2011
Erratum to: The capacitated max <i>k</i>-cut problem.
Math. Program., 2011

The Design of Durable Goods.
Mark. Sci., 2011

2010
Package Size Decisions.
Manag. Sci., 2010

2009
Conflict Resolution in the Scheduling of Television Commercials.
Oper. Res., 2009

2008
The capacitated max <i>k</i> -cut problem.
Math. Program., 2008

2007
Probabilistic Greedy Heuristics for Satisfiability Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

2006
Some Empirical Regularities in Market Shares.
Manag. Sci., 2006

Subset-conjunctive rules for breast cancer diagnosis.
Discret. Appl. Math., 2006

2004
Average performance of greedy heuristics for the integer knapsack problem.
Eur. J. Oper. Res., 2004

2003
Why Parrondo's paradox is irrelevant for utility theory, stock buying, and the emergence of life.
Complex., 2003

1999
Lexicographic systems.
Complex., 1999

1996
Capacitated Location Problems on a Line.
Transp. Sci., 1996

1995
Joint Performance of Greedy Heuristics for the Integer Knapsack Problem.
Discret. Appl. Math., 1995

1994
The Minimum Satisfiability Problem.
SIAM J. Discret. Math., 1994

1992
A total-value greedy heuristic for the integer knapsack problem.
Oper. Res. Lett., 1992

1989
Average Performance of Heuristics for Satisfiability.
SIAM J. Discret. Math., 1989


  Loading...