Остановите войну!
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 46 matches
- 1991
- Alfred Auslender, Roberto Cominetti:
A Comparative Study of Multifunction Differentiability with Applications in Mathematical Programming. Math. Oper. Res. 16(2): 240-258 (1991) - Dimitri P. Bertsekas, John N. Tsitsiklis:
An Analysis of Stochastic Shortest Path Problems. Math. Oper. Res. 16(3): 580-595 (1991) - Dan Bienstock:
Some Generalized Max-Flow Min-Cut Problems in the Plane. Math. Oper. Res. 16(2): 310-333 (1991) - Sylvia C. Boyd, William H. Cunningham:
Small Travelling Salesman Polytopes. Math. Oper. Res. 16(2): 259-271 (1991) - Patrick L. Brockett, Abraham Charnes:
Information Theoretic Approach to Geometric Programming. Math. Oper. Res. 16(4): 888-889 (1991) - Hong Chen, Avi Mandelbaum:
Discrete Flow Networks: Bottleneck Analysis and Fluid Approximations. Math. Oper. Res. 16(2): 408-446 (1991) - Costas Courcoubetis, Uriel G. Rothblum:
On Optimal Packing of Randomly Arriving Objects. Math. Oper. Res. 16(1): 176-194 (1991) - Daryl J. Daley, Tomasz Rolski:
Light Traffic Approximations in Queues. Math. Oper. Res. 16(1): 57-71 (1991) - Chuangyin Dang:
The D1-Triangulation of Rn for Simplicial Algorithms for Computing Solutions of Nonlinear Equations. Math. Oper. Res. 16(1): 148-161 (1991) - Matteo Fischetti:
Facets of the Asymmetric Traveling Salesman Polytope. Math. Oper. Res. 16(1): 42-56 (1991) - Ben G. Fitzpatrick, Wendell H. Fleming:
Numerical Methods for an Optimal Investment-Consumption Model. Math. Oper. Res. 16(4): 823-841 (1991) - Wendell H. Fleming, Thaleia Zariphopoulou:
An Optimal Investment/Consumption Model with Borrowing. Math. Oper. Res. 16(4): 802-822 (1991) - Robert M. Freund, Kok-Choon Tan:
A Method for the Parametric Center Problem, with a Strictly Monotone Polynomial-Time Algorithm for Linear Programming. Math. Oper. Res. 16(4): 775-801 (1991) - Michel X. Goemans, Dimitris J. Bertsimas:
Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem. Math. Oper. Res. 16(1): 72-89 (1991) - Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos:
Combinatorial Algorithms for the Generalized Circulation Problem. Math. Oper. Res. 16(2): 351-381 (1991) - Pierre Hansen, Brigitte Jaumard, Shi-Hui Lu:
On the Number of Iterations of Piyavskii's Global Optimization Algorithm. Math. Oper. Res. 16(2): 334-350 (1991) - Refael Hassin, Nimrod Megiddo:
Exact Computation of Optimal Inventory Policies Over an Unbounded Horizon. Math. Oper. Res. 16(3): 534-546 (1991) - Christian Hess:
Convergence of Conditional Expectations for Unbounded Random Sets, Integrands, and Integral Functionals. Math. Oper. Res. 16(3): 627-649 (1991) - Julia L. Higle, Suvrajeet Sen:
Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse. Math. Oper. Res. 16(3): 650-669 (1991) - Peter L. Jackson, Robin O. Roundy:
Minimizing Separable Convex Objectives on Arbitrarily Directed Trees of Variable Upper Bound Constraints. Math. Oper. Res. 16(3): 504-533 (1991) - Kazuya Kamiya:
Efficient Algorithms for Solving Systems of Nonlinear Equations with a Block Diagonal Structure. Math. Oper. Res. 16(3): 566-579 (1991) - Kazuya Kamiya, A. J. J. Talman:
Simplicial Algorithm to Find Zero Points of a Function with Special Structure on a Simplotope. Math. Oper. Res. 16(3): 609-626 (1991) - Masakazu Kojima, Nimrod Megiddo, Toshihito Noma:
Homotopy Continuation Methods for Nonlinear Complementarity Problems. Math. Oper. Res. 16(4): 754-774 (1991) - John P. Lehoczky, Suresh P. Sethi, H. Mete Soner, Michael I. Taksar:
An Asymptotic Analysis of Hierarchical Control of Manufacturing Systems Under Uncertainty. Math. Oper. Res. 16(3): 596-608 (1991) - Jean-François Mertens:
Stable Equilibria - A Reformulation. Part II. Discussion of the Definition, and Further Results. Math. Oper. Res. 16(4): 694-753 (1991) - Masakiyo Miyazawa:
The Characterization of the Stationary Distribution of the Supplemented Self-Clocking Jump Process. Math. Oper. Res. 16(3): 547-565 (1991) - Renato D. C. Monteiro:
Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming. Math. Oper. Res. 16(4): 842-858 (1991) - Michael G. Monticino:
The Adequacy of Universal Strategies in Analytic Gambling Problems. Math. Oper. Res. 16(1): 21-41 (1991) - George L. O'Brien, Marco Scarsini:
Multivariate Stochastic Dominance and Moments. Math. Oper. Res. 16(2): 382-389 (1991) - Hans Peters, Eric van Damme:
Characterizing the Nash and Raiffa Bargaining Solutions by Disagreement Point Axioms. Math. Oper. Res. 16(3): 447-461 (1991)
skipping 16 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-06-07 20:00 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