default search action
Search 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 22 matches
- 2023
- Kevin-Martin Aigner, Andreas Bärmann, Kristin Braun, Frauke Liers, Sebastian Pokutta, Oskar Schneider, Kartikey Sharma, Sebastian Tschuppik:
Data-Driven Distributionally Robust Optimization over Time. INFORMS J. Optim. 5(4): 376-394 (2023) - Kim Allan Andersen, Trine Krogh Boomsma, Lars Relund Nielsen:
MILP Sensitivity Analysis for the Objective Function Coefficients. INFORMS J. Optim. 5(1): 92-109 (2023) - Dimitris Bertsimas, Nathan Kallus:
The Power and Limits of Predictive Approaches to Observational Data-Driven Optimization: The Case of Pricing. INFORMS J. Optim. 5(1): 110-129 (2023) - Dimitris Bertsimas, Omar Skali Lami:
Holistic Prescriptive Analytics for Continuous and Constrained Optimization Problems. INFORMS J. Optim. 5(2): 155-171 (2023) - Steffen Borgwardt, Felix Happach, Stetson Zirkelbach:
An Algorithm for the Separation-Preserving Transition of Clusterings. INFORMS J. Optim. 5(1): 1-26 (2023) - Nicolas Busch, Tobias Crönert, Stefan Minner, Moritz Rettinger, Burakhan Sel:
Deep Learning for Commodity Procurement: Nonlinear Data-Driven Optimization of Hedging Decisions. INFORMS J. Optim. 5(3): 273-294 (2023) - Alexander S. Estes, Jean-Philippe P. Richard:
Smart Predict-then-Optimize for Two-Stage Linear Programs with Side Information. INFORMS J. Optim. 5(3): 295-320 (2023) - Nam Ho-Nguyen, Fatma Kilinç-Karzan, Simge Küçükyavuz, Dabeen Lee:
Strong Formulations for Distributionally Robust Chance-Constrained Programs with Left-Hand Side Uncertainty Under Wasserstein Ambiguity. INFORMS J. Optim. 5(2): 211-232 (2023) - Dabeen Lee, Milan Vojnovic, Se-Young Yun:
Test Score Algorithms for Budgeted Stochastic Utility Maximization. INFORMS J. Optim. 5(1): 27-67 (2023) - Wei Liu, Li Yang, Bo Yu:
Distributionally Robust Optimization Based on Kernel Density Estimation and Mean-Entropic Value-at-Risk. INFORMS J. Optim. 5(1): 68-91 (2023) - Ian G. Ludden, Rahul Swamy, Douglas M. King, Sheldon H. Jacobson:
A Bisection Protocol for Political Redistricting. INFORMS J. Optim. 5(3): 233-255 (2023) - Ziye Ma, Yingjie Bi, Javad Lavaei, Somayeh Sojoudi:
Geometric Analysis of Noisy Low-Rank Matrix Recovery in the Exact Parametrized and the Overparametrized Regimes. INFORMS J. Optim. 5(4): 356-375 (2023) - Andrew Mastin, Arden Baxter, Amelia Musselman, Jean-Paul Watson:
Best Response Intersection: An Optimal Algorithm for Interdiction Defense. INFORMS J. Optim. 5(2): 172-190 (2023) - Frederic Matter, Marc E. Pfetsch:
Presolving for Mixed-Integer Semidefinite Optimization. INFORMS J. Optim. 5(2): 131-154 (2023) - Mouad Morabit, Guy Desaulniers, Andrea Lodi:
Machine-Learning-Based Arc Selection for Constrained Shortest Path Problems in Column Generation. INFORMS J. Optim. 5(2): 191-210 (2023) - Anthony Nguyen, Krishnakumar Balasubramanian:
Stochastic Zeroth-Order Functional Constrained Optimization: Oracle Complexity and Applications. INFORMS J. Optim. 5(3): 256-272 (2023) - Mengmeng Song, Yong Xia, Hongying Liu:
Local Optimality Conditions for a Family of Hidden Convex Optimization. INFORMS J. Optim. 5(4): 340-355 (2023) - Kaizhao Sun, Xu Andy Sun:
Algorithms for Difference-of-Convex Programs Based on Difference-of-Moreau-Envelopes Smoothing. INFORMS J. Optim. 5(4): 321-339 (2023) - Editorial Board. INFORMS J. Optim. 5(1): 2- (2023)
- Editorial Board. INFORMS J. Optim. 5(2): 2- (2023)
- Editorial Board. INFORMS J. Optim. 5(3): 2- (2023)
- Editorial Board. INFORMS J. Optim. 5(4): 2- (2023)
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-10-31 20:13 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