default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuri Levin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c1]Aliaksandr Nekrashevich, Yuri Levin, Guang Li, Mikhail Nediak:
Data Analytics for Resort Revenue Management. CCECE 2024: 154-155- 2020
- [j16]Jue Wang
, Yuri Levin, Mikhail Nediak:
Selling Passes to Strategic Customers. Oper. Res. 68(4): 1095-1115 (2020)
2010 – 2019
- 2014
- [j15]Yuri Levin, Mikhail Nediak, Andrei Bazhanov:
Quantity Premiums and Discounts in Dynamic Pricing. Oper. Res. 62(4): 846-863 (2014) - 2012
- [j14]Yuri Levin, Mikhail Nediak, Huseyin Topaloglu:
Cargo Capacity Management with Allotments and Spot Market Demand. Oper. Res. 60(2): 351-365 (2012) - 2011
- [j13]Tatsiana Levina, Yuri Levin, Jeff McGill, Mikhail Nediak:
Network Cargo Capacity Management. Oper. Res. 59(4): 1008-1023 (2011) - [p1]Adi Ben-Israel, Yuri Levin:
The Newton Bracketing Method for Convex Minimization: Convergence Analysis. Fixed-Point Algorithms for Inverse Problems in Science and Engineering 2011: 49-64 - 2010
- [j12]Tatsiana Levina, Yuri Levin, Jeff McGill, Mikhail Nediak, Vladimir Vovk:
Weak aggregating algorithm for the distribution-free perishable inventory problem. Oper. Res. Lett. 38(6): 516-521 (2010)
2000 – 2009
- 2009
- [j11]Yuri Levin, Jeff McGill:
Introduction to the special issue on revenue management and dynamic pricing. Eur. J. Oper. Res. 197(3): 845-847 (2009) - [j10]Tatsiana Levina, Yuri Levin, Jeff McGill, Mikhail Nediak:
Dynamic Pricing with Online Learning and Strategic Consumers: An Application of the Aggregating Algorithm. Oper. Res. 57(2): 327-341 (2009) - [j9]Yuri Levin, Jeff McGill, Mikhail Nediak:
Dynamic Pricing in the Presence of Strategic Consumers and Oligopolistic Competition. Manag. Sci. 55(1): 32-46 (2009) - 2008
- [j8]Adi Ben-Israel, Yuri Levin:
The Newton Bracketing method for the minimization of convex functions subject to affine constraints. Discret. Appl. Math. 156(11): 1977-1987 (2008) - [j7]Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris Rozin:
Approximate methods for convex minimization problems with series-parallel structure. Eur. J. Oper. Res. 189(3): 841-855 (2008) - [j6]Yuri Levin, Jeff McGill, Mikhail Nediak:
Risk in Revenue Management and Dynamic Pricing. Oper. Res. 56(2): 326-343 (2008) - 2007
- [j5]Yuri Levin, Jeff McGill, Mikhail Nediak:
Price Guarantees in Dynamic Pricing and Revenue Management. Oper. Res. 55(1): 75-97 (2007) - [j4]Tatsiana Levina, Yuri Levin, Jeff McGill, Mikhail Nediak:
Linear programming with online learning. Oper. Res. Lett. 35(5): 612-618 (2007) - 2004
- [j3]Yuri Levin, Adi Ben-Israel:
A heuristic method for large-scale multi-facility location problems. Comput. Oper. Res. 31(2): 257-272 (2004) - 2002
- [j2]Yuri Levin, Adi Ben-Israel:
The Newton Bracketing Method for Convex Minimization. Comput. Optim. Appl. 21(2): 213-229 (2002) - [j1]Yuri Levin, Adi Ben-Israel:
Directional Newton methods in n variables. Math. Comput. 71(237): 251-262 (2002)
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-11-25 23:45 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:
