default search action
Rajeev Kohli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i2]Rajeev Kohli, Kriste Krstovski, Hengyu Kuang, Hengxu Lin:
Sequential choice in ordered bundles. CoRR abs/2410.21670 (2024)
2010 – 2019
- 2019
- [j18]Rajeev Kohli
, Khaled Boughanmi, Vikram Kohli:
Randomized Algorithms for Lexicographic Inference. Oper. Res. 67(2): 357-375 (2019) - 2017
- [j17]Rajeev Kohli, Kamel Jedidi:
Relation Between EBA and Nested Logit Models. Oper. Res. 65(3): 621-634 (2017) - 2015
- [j16]Rajeev Kohli, Kamel Jedidi:
Error Theory for Elimination by Aspects. Oper. Res. 63(3): 512-526 (2015) - [i1]Rajeev Kohli, Ramesh Krishnamurti:
Lower Bound for the Unique Games Problem. CoRR abs/1508.01586 (2015) - 2011
- [j15]Oded Koenigsberg
The Design of Durable Goods. Mark. Sci. 30(1): 111-122 (2011) - [j14]Daya Ram Gaur
Erratum to: The capacitated max k-cut problem. Math. Program. 126(1): 191 (2011) - 2010
- [j13]Oded Koenigsberg
Package Size Decisions. Manag. Sci. 56(3): 485-494 (2010)
2000 – 2009
- 2009
- [j12]Daya Ram Gaur
Conflict Resolution in the Scheduling of Television Commercials. Oper. Res. 57(5): 1098-1105 (2009) - 2008
- [j11]Daya Ram Gaur
The capacitated max k -cut problem. Math. Program. 115(1): 65-72 (2008) - 2007
- [r1]Ramesh Krishnamurti, Rajeev Kohli:
Probabilistic Greedy Heuristics for Satisfiability Problems. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j10]Rajeev Kohli, Ramesh Krishnamurti, Kamel Jedidi:
Subset-conjunctive rules for breast cancer diagnosis. Discret. Appl. Math. 154(7): 1100-1112 (2006) - [j9]Rajeev Kohli, Raaj Sah:
Some Empirical Regularities in Market Shares. Manag. Sci. 52(11): 1792-1798 (2006) - 2004
- [j8]Rajeev Kohli, Ramesh Krishnamurti, Prakash Mirchandani:
Average performance of greedy heuristics for the integer knapsack problem. Eur. J. Oper. Res. 154(1): 36-45 (2004) - 2003
- [j7]Raghuram Iyengar, Rajeev Kohli:
Why Parrondo's paradox is irrelevant for utility theory, stock buying, and the emergence of life. Complex. 9(1): 23-27 (2003)
1990 – 1999
- 1999
- [j6]Rajeev Kohli:
Lexicographic systems. Complex. 4(4): 15-25 (1999) - 1996
- [j5]Prakash Mirchandani, Rajeev Kohli, Arie Tamir:
Capacitated Location Problems on a Line. Transp. Sci. 30(1): 75-80 (1996) - 1995
- [j4]Rajeev Kohli, Ramesh Krishnamurti:
Joint Performance of Greedy Heuristics for the Integer Knapsack Problem. Discret. Appl. Math. 56(1): 37-48 (1995) - 1994
- [j3]Rajeev Kohli, Ramesh Krishnamurti, Prakash Mirchandani:
The Minimum Satisfiability Problem. SIAM J. Discret. Math. 7(2): 275-283 (1994) - 1992
- [j2]Rajeev Kohli, Ramesh Krishnamurti:
A total-value greedy heuristic for the integer knapsack problem. Oper. Res. Lett. 12(2): 65-71 (1992)
1980 – 1989
- 1989
- [j1]Rajeev Kohli, Ramesh Krishnamurti:
Average Performance of Heuristics for Satisfiability. SIAM J. Discret. Math. 2(4): 508-523 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: