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 60 matches
- 1993
- Zvi Artstein, Roger J.-B. Wets:
Sensors and Information in Optimization Under Stochastic Uncertainty. Math. Oper. Res. 18(3): 523-547 (1993) - Hédy Attouch, Hassan Riahi:
Stability Results for Ekeland's ε-Variational Principle and Cone Extremal Solutions. Math. Oper. Res. 18(1): 173-201 (1993) - Claude J. P. Bélisle, H. Edwin Romeijn, Robert L. Smith:
Hit-and-Run Algorithms for Generating Multivariate Distributions. Math. Oper. Res. 18(2): 255-266 (1993) - Partha P. Bhattacharya, Leonidas Georgiadis, Pantelis Tsoucas, Ioannis Viniotis:
Adaptive Lexicographic Optimization in Multi-Class M/GI/1 Queues. Math. Oper. Res. 18(3): 705-740 (1993) - Daniel Bienstock:
A Lot-Sizing Problem on Trees, Related to Network Design. Math. Oper. Res. 18(2): 402-422 (1993) - Daniel Bienstock, Julien Bramel, David Simchi-Levi:
A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands. Math. Oper. Res. 18(4): 786-802 (1993) - John R. Birge, Liqun Qi:
Semiregularity and Generalized Subdifferentials with Applications to Optimization. Math. Oper. Res. 18(4): 982-1005 (1993) - Wolfgang Blum:
An Approximation for a Continuous Max-Flow Problem. Math. Oper. Res. 18(1): 98-115 (1993) - Endre Boros, Peter L. Hammer:
Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions. Math. Oper. Res. 18(1): 245-253 (1993) - Cheng-Shang Chang, David D. Yao:
Rearrangement, Majorization and Stochastic Scheduling. Math. Oper. Res. 18(3): 658-684 (1993) - Edward G. Coffman Jr., Leopold Flatto, Paul E. Wright:
Stochastic Machine Minimization with Constant Service Times. Math. Oper. Res. 18(2): 300-316 (1993) - Yang Dai, Dolf Talman:
Linear Stationary Point Problems on Unbounded Polyhedra. Math. Oper. Res. 18(3): 635-644 (1993) - Jonathan Eckstein:
Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming. Math. Oper. Res. 18(1): 202-226 (1993) - Guy Fayolle, V. A. Malyshev, M. V. Menshikov, A. F. Sidorenko:
Lyapounov Functions for Jackson Networks. Math. Oper. Res. 18(4): 916-927 (1993) - Itzhak Gilboa, Ehud Kalai, Eitan Zemel:
The Complexity of Eliminating Dominated Strategies. Math. Oper. Res. 18(3): 553-565 (1993) - Paul Glasserman:
Filtered Monte Carlo. Math. Oper. Res. 18(3): 610-634 (1993) - Michel X. Goemans, Muralidharan S. Kodialam:
A Lower Bound on the Expected Cost of an Optimal Assignment. Math. Oper. Res. 18(2): 267-274 (1993) - M. Seetharama Gowda:
Applications of Degree Theory to Linear Complementarity Problems. Math. Oper. Res. 18(4): 868-879 (1993) - Faruk Gül, David Pearce, Ennio Stacchetti:
A Bound on the Proportion of Pure Strategy Equilibria in Generic Games. Math. Oper. Res. 18(3): 548-552 (1993) - Osman Güler:
Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems. Math. Oper. Res. 18(1): 128-147 (1993) - Arie Harel:
Random Walk and the Area Below its Path. Math. Oper. Res. 18(3): 566-577 (1993) - P. J. Hunt, C. N. Laws:
Asymptotically Optimal Loss Network Control. Math. Oper. Res. 18(4): 880-900 (1993) - Frank K. Hwang, Uriel G. Rothblum:
Majorization and Schur Convexity with Respect to Partial Orders. Math. Oper. Res. 18(4): 928-944 (1993) - Patrick Jaillet:
Analysis of Probabilistic Combinatorial Optimization Problems in Euclidean Spaces. Math. Oper. Res. 18(1): 51-70 (1993) - Uwe Jensen, Guang-Hui Hsu:
Optimal Stopping by Means of Point Process Observations with Applications in Reliability. Math. Oper. Res. 18(3): 645-657 (1993) - Abderrahim Jourani, L. Thibault:
Approximations and Metric Regularity in Mathematical Programming in Banach Space. Math. Oper. Res. 18(2): 390-401 (1993) - Richard M. Karp, Rajeev Motwani, Noam Nisan:
Probabilistic Analysis of Network Flow Algorithms. Math. Oper. Res. 18(1): 71-97 (1993) - Masaaki Kijima:
Quasi-Stationary Distributions of Single-Server Phase-Type Queues. Math. Oper. Res. 18(2): 423-437 (1993) - Alan J. King, R. Tyrrell Rockafellar:
Asymptotic Theory for Solutions in Statistical Estimation and Stochastic Programming. Math. Oper. Res. 18(1): 148-162 (1993) - Masakazu Kojima, Nimrod Megiddo, Shinji Mizuno:
A General Framework of Continuation Methods for Complementarity Problems. Math. Oper. Res. 18(4): 945-963 (1993)
skipping 30 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-12-18 10:26 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