![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
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 24 matches
- 2016
- Ethan B. Anderes, Steffen Borgwardt, Jacob Miller:
Discrete Wasserstein barycenters: optimal transport for discrete data. Math. Methods Oper. Res. 84(2): 389-409 (2016) - Shuang Chen, Li-Ping Pang, Xuefei Ma, Dan Li:
SAA method based on modified Newton method for stochastic variational inequality with second-order cone constraints and application in portfolio optimization. Math. Methods Oper. Res. 84(1): 129-154 (2016) - Andreas Darmann:
It is difficult to tell if there is a Condorcet spanning tree. Math. Methods Oper. Res. 84(1): 93-104 (2016) - Claudia Gotzes, Holger Heitsch, René Henrion, Rüdiger Schultz:
On the quantification of nomination feasibility in stationary gas networks with random load. Math. Methods Oper. Res. 84(2): 427-457 (2016) - Christian Günther
, Christiane Tammer:
Relationships between constrained and unconstrained multi-objective optimization and application in location theory. Math. Methods Oper. Res. 84(2): 359-387 (2016) - Eduard Kromer
, Ludger Overbeck, Katrin Zilch:
Systemic risk measures on general measurable spaces. Math. Methods Oper. Res. 84(2): 323-357 (2016) - Lukasz Kruk:
Minimality of EDF networks with resource sharing. Math. Methods Oper. Res. 84(2): 259-283 (2016) - Zhibin Liang, Junna Bi, Kam Chuen Yuen, Caibin Zhang:
Optimal mean-variance reinsurance and investment in a jump-diffusion financial market with common shock dependence. Math. Methods Oper. Res. 84(1): 155-181 (2016) - Yong-Jin Liu, Li Wang:
Properties associated with the epigraph of the \(l_1\) norm function of projection onto the nonnegative orthant. Math. Methods Oper. Res. 84(1): 205-221 (2016) - Andreas Löhne, Benjamin Weißing:
Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming. Math. Methods Oper. Res. 84(2): 411-426 (2016) - Andreas Löpker:
On the overflow time of a fluid model. Math. Methods Oper. Res. 84(1): 59-92 (2016) - John Martinovic, Guntram Scheithauer:
The proper relaxation and the proper gap of the skiving stock problem. Math. Methods Oper. Res. 84(3): 527-548 (2016) - Armando F. Mendoza-Pérez, Héctor Jasso-Fuentes, Omar A. De-la-Cruz Courtois:
Constrained Markov decision processes in Borel spaces: from discounted to average optimality. Math. Methods Oper. Res. 84(3): 489-525 (2016) - Marieke Musegaas, Peter E. M. Borm
, Marieke Quant
:
Simple and three-valued simple minimum coloring games. Math. Methods Oper. Res. 84(2): 239-258 (2016) - Steffen Rebennack
:
Computing tight bounds via piecewise linear functions through the example of circle cutting problems. Math. Methods Oper. Res. 84(1): 3-57 (2016) - Dmitry B. Rokhlin
, Georgii Mironenko:
Regular finite fuel stochastic control problems with exit time. Math. Methods Oper. Res. 84(1): 105-127 (2016) - Linsong Shen, Yanjun Wang, Xiaomei Zhang:
Robust canonical duality theory for solving nonconvex programming problems under data uncertainty. Math. Methods Oper. Res. 84(1): 183-204 (2016) - H. Mete Soner
, Mirjana Vukelja:
Utility maximization in an illiquid market in continuous time. Math. Methods Oper. Res. 84(2): 285-321 (2016) - Oliver Stein:
Editorial. Math. Methods Oper. Res. 84(1): 1 (2016) - Oliver Stein
:
Editorial. Math. Methods Oper. Res. 84(3): 459 (2016) - Qingda Wei:
Continuous-time Markov decision processes with risk-sensitive finite-horizon cost criterion. Math. Methods Oper. Res. 84(3): 461-487 (2016) - Jiuping Xu, Guomin Fang, Zezhong Wu:
Network equilibrium of production, transportation and pricing for multi-product multi-market. Math. Methods Oper. Res. 84(3): 567-595 (2016) - Yangdong Xu, Shengjie Li:
On the solution continuity of parametric set optimization problems. Math. Methods Oper. Res. 84(1): 223-237 (2016) - Le Hai Yen
, Le Dung Muu, Nguyen Thi Thanh Huyen:
An algorithm for a class of split feasibility problems: application to a model in electricity production. Math. Methods Oper. Res. 84(3): 549-565 (2016)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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-07-08 07:46 CEST 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