Остановите войну!
for scientists:
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 26 matches
- 2013
- Stefan Richter, Colin Neil Jones, Manfred Morari:
Certification aspects of the fast gradient method for solving the dual of parametric convex programs. Math. Methods Oper. Res. 77(3): 305-321 (2013) - Pablo Azcue, Nora Muler:
Minimizing the ruin probability allowing investments in two assets: a two-dimensional problem. Math. Methods Oper. Res. 77(2): 177-206 (2013) - Michel Baes, Michael Bürgisser:
Hedge algorithm and Dual Averaging schemes. Math. Methods Oper. Res. 77(3): 279-289 (2013) - Philipp Baumann, Norbert Trautmann:
Portfolio-optimization models for small investors. Math. Methods Oper. Res. 77(3): 345-356 (2013) - Dimitris Bertsimas, Vineet Goyal:
On the approximability of adjustable robust convex optimization under uncertainty. Math. Methods Oper. Res. 77(3): 323-343 (2013) - Martin Branda:
On relations between chance constrained and penalty function problems under discrete distributions. Math. Methods Oper. Res. 77(2): 265-277 (2013) - Peter Bühlmann:
Causal statistical inference in high dimensions. Math. Methods Oper. Res. 77(3): 357-370 (2013) - Yongyang Cai, Kenneth L. Judd:
Shape-preserving dynamic programming. Math. Methods Oper. Res. 77(3): 407-421 (2013) - Jiawei Chen, Zhongping Wan, Yeol Je Cho:
Levitin-Polyak well-posedness by perturbations for systems of set-valued vector quasi-equilibrium problems. Math. Methods Oper. Res. 77(1): 33-64 (2013) - Sören Christensen:
Optimal decision under ambiguity for diffusion processes. Math. Methods Oper. Res. 77(2): 207-226 (2013) - Eleftherios Couzoudis, Philipp Renner:
Computing generalized Nash equilibria by polynomial programming. Math. Methods Oper. Res. 77(3): 459-472 (2013) - Elke Eisenschmidt, Utz-Uwe Haus:
A polynomial time approximation algorithm for the two-commodity splittable flow problem. Math. Methods Oper. Res. 77(3): 381-391 (2013) - Paul Embrechts, Marius Hofert:
A note on generalized inverses. Math. Methods Oper. Res. 77(3): 423-432 (2013) - Francisco Facchinei, Andreas Fischer, Markus Herrich:
A family of Newton methods for nonsmooth constrained systems with nonisolated solutions. Math. Methods Oper. Res. 77(3): 433-443 (2013) - Zhigang Feng:
Tackling indeterminacy in overlapping generations models. Math. Methods Oper. Res. 77(3): 445-457 (2013) - Gerwald van Gulick, Henk Norde:
Fuzzy cores and fuzzy balancedness. Math. Methods Oper. Res. 77(2): 131-146 (2013) - Mario Hellmich, Heinz-Peter Berg:
On the construction of component importance measures for semi-Markov systems. Math. Methods Oper. Res. 77(1): 15-32 (2013) - Roland Herzog, Karl Kunisch, Jörn Sass:
Primal-dual methods for the computation of trading regions under proportional transaction costs. Math. Methods Oper. Res. 77(1): 101-130 (2013) - Michael A. Jones, Jennifer M. Wilson:
Two-step coalition values for multichoice games. Math. Methods Oper. Res. 77(1): 65-99 (2013) - Diethard Klatte, Bernd Kummer:
Aubin property and uniqueness of solutions in cone constrained optimization. Math. Methods Oper. Res. 77(3): 291-304 (2013) - Daniel Lücking, Wolfgang Stadje:
The stochastic shortest-path problem for Markov chains with infinite state space with applications to nearest-neighbor lattice chains. Math. Methods Oper. Res. 77(2): 239-264 (2013) - Conrado Manuel, Enrique González-Arangüena, René van den Brink:
Players indifferent to cooperate and characterizations of the Shapley value. Math. Methods Oper. Res. 77(1): 1-14 (2013) - Kaspar Schüpbach, Rico Zenklusen:
An adaptive routing approach for personal rapid transit. Math. Methods Oper. Res. 77(3): 371-380 (2013) - M. D. Voisei, Constantin Zalinescu:
Counterexamples to a triality theorem for quadratic-exponential minimization problems. Math. Methods Oper. Res. 77(2): 227-237 (2013) - Qiang Zhen, Charles Knessl:
On spectral properties of finite population processor shared queues. Math. Methods Oper. Res. 77(2): 147-176 (2013) - Gauthier de Maere d'Aertrycke, Alexander Shapiro, Yves Smeers:
Risk exposure and Lagrange multipliers of nonanticipativity constraints in multistage stochastic problems. Math. Methods Oper. Res. 77(3): 393-405 (2013)
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-05-15 18:47 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