default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 83 matches
- 2024
- José Correa
, Andrés Cristi, Boris Epstein, José A. Soto:
Sample-Driven Optimal Stopping: From the Secretary Problem to the i.i.d. Prophet Inequality. Math. Oper. Res. 49(1): 441-475 (2024) - Xi Chen, Will Ma, David Simchi-Levi, Linwei Xin:
Assortment Planning for Recommendations at Checkout Under Inventory Constraints. Math. Oper. Res. 49(1): 297-325 (2024) - Lei Guo, Jane J. Ye, Jin Zhang:
Sensitivity Analysis of the Maximal Value Function with Applications in Nonconvex Minimax Programs. Math. Oper. Res. 49(1): 536-556 (2024) - Xin Chen, Alexander L. Stolyar, Linwei Xin:
Asymptotic Optimality of Constant-Order Policies in Joint Pricing and Inventory Models. Math. Oper. Res. 49(1): 557-577 (2024) - Wim van Ackooij, Pedro Pérez-Aros, Claudia Soto, Emilio Vilches:
Inner Moreau Envelope of Nonsmooth Conic Chance-Constrained Optimization Problems. Math. Oper. Res. 49(3): 1419-1451 (2024) - Stefan Ankirchner, Nabil Kazi-Tani, Julian Wendt, Chao Zhou:
Large Ranking Games with Diffusion Control. Math. Oper. Res. 49(2): 675-696 (2024) - Manuel Aprile, Michele Conforti, Marco Di Summa:
Binary Extended Formulations and Sequential Convexification. Math. Oper. Res. 49(3): 1566-1581 (2024) - Armin Askari, Alexandre d'Aspremont, Laurent El Ghaoui:
Naive Feature Selection: A Nearly Tight Convex Relaxation for Sparse Naive Bayes. Math. Oper. Res. 49(1): 278-296 (2024) - Elizabeth Baldwin, Paul W. Goldberg, Paul Klemperer, Edwin Lock:
Solving Strong-Substitutes Product-Mix Auctions. Math. Oper. Res. 49(3): 1502-1534 (2024) - Heinz H. Bauschke, Walaa M. Moursi:
On the Douglas-Rachford Algorithm for Solving Possibly Inconsistent Optimization Problems. Math. Oper. Res. 49(1): 58-77 (2024) - Ewelina Bednarz, Philip A. Ernst, Adam Osekowski:
On the Diameter of the Stopped Spider Process. Math. Oper. Res. 49(1): 346-365 (2024) - Patrick Beißner, Tim J. Boonen, Mario Ghossoub:
(No-)Betting Pareto Optima Under Rank-Dependent Utility. Math. Oper. Res. 49(3): 1452-1471 (2024) - Pascal Bianchi, Walid Hachem, Sholom Schechtman:
Stochastic Subgradient Descent Escapes Active Strict Saddles on Weakly Convex Functions. Math. Oper. Res. 49(3): 1761-1790 (2024) - Vittorio Bilò, Luca Moscardelli, Cosimo Vinci:
Uniform Mixed Equilibria in Network Congestion Games with Link Failures. Math. Oper. Res. 49(1): 509-535 (2024) - Ernesto G. Birgin, John L. C. Gardenghi, Antoine Laurain:
Bounds on the Optimal Radius When Covering a Set with Minimum Radius Identical Disks. Math. Oper. Res. 49(3): 1855-1889 (2024) - Péter Biró, Flip Klijn, Xenia Klimentova, Ana Viana:
Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange. Math. Oper. Res. 49(3): 1938-1972 (2024) - Moïse Blanchard, Alexandre Jacquillat, Patrick Jaillet:
Probabilistic Bounds on the k-Traveling Salesman Problem and the Traveling Repairman Problem. Math. Oper. Res. 49(2): 1169-1191 (2024) - José H. Blanchet, Renyuan Xu, Zhengyuan Zhou:
Delay-Adaptive Learning in Generalized Linear Contextual Bandits. Math. Oper. Res. 49(1): 326-345 (2024) - Simina Brânzei, Fedor Sandomirskiy:
Algorithms for Competitive Division of Chores. Math. Oper. Res. 49(1): 398-429 (2024) - Luis M. Briceño-Arias, Patrick L. Combettes:
A Perturbation Framework for Convex Minimization and Monotone Inclusion Problems with Nonlinear Compositions. Math. Oper. Res. 49(3): 1890-1914 (2024) - Johannes Brustle, José Correa, Paul Duetting, Victor Verdugo:
The Competition Complexity of Dynamic Pricing. Math. Oper. Res. 49(3): 1986-2008 (2024) - Qi Cai, Zhuoran Yang, Jason D. Lee, Zhaoran Wang:
Neural Temporal Difference and Q Learning Provably Converge to Global Optima. Math. Oper. Res. 49(1): 619-651 (2024) - J. Massey Cashore, Peter I. Frazier, Éva Tardos:
Dynamic Pricing Provides Robust Equilibria in Stochastic Ridesharing Networks. Math. Oper. Res. 49(3): 1647-1677 (2024) - Ales Cerný, Christoph Czichowsky, Jan Kallsen:
Numeraire-Invariant Quadratic Hedging and Mean-Variance Portfolio Allocation. Math. Oper. Res. 49(2): 752-781 (2024) - Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Bilateral Trade: A Regret Minimization Perspective. Math. Oper. Res. 49(1): 171-203 (2024) - Vasileios Charisopoulos, Damek Davis:
A Superlinearly Convergent Subgradient Method for Sharp Semismooth Problems. Math. Oper. Res. 49(3): 1678-1709 (2024) - Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao:
Packing Feedback Arc Sets in Tournaments Exactly. Math. Oper. Res. 49(1): 151-170 (2024) - Yiwen Chen, Warren L. Hare, Gabriel Jarry-Bolduc:
Error Analysis of Surrogate Models Constructed Through Operations on Submodels. Math. Oper. Res. 49(1): 1-18 (2024) - Péter Csóka, P. Jean-Jacques Herings:
Uniqueness of Clearing Payment Matrices in Financial Networks. Math. Oper. Res. 49(1): 232-250 (2024) - Xingbang Cui, Liping Zhang:
A Localized Progressive Hedging Algorithm for Solving Nonmonotone Stochastic Variational Inequalities. Math. Oper. Res. 49(3): 1915-1937 (2024)
skipping 53 more matches
loading more results 
failed to load more results, please try again later
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.
retrieved on 2024-11-05 05:18 CET from data curated 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:
