![](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 47 matches
- 1997
- Murat Alanyali, Bruce E. Hajek:
Analysis of Simple Algorithms for Dynamic Load Balancing. Math. Oper. Res. 22(4): 840-871 (1997) - Eitan Altman, Arie Hordijk, F. M. Spieksma
:
Contraction Conditions for Average and α-Discount Optimality in Countable State Markov Games with Unbounded Rewards. Math. Oper. Res. 22(3): 588-618 (1997) - Rafael Amer, Francesc Carreras:
Cooperation Indices and Weighted Shapley Values. Math. Oper. Res. 22(4): 955-968 (1997) - Kurt M. Anstreicher:
On Vaidya's Volumetric Cutting Plane Method for Convex Programming. Math. Oper. Res. 22(1): 63-89 (1997) - Alfred Auslender, Roberto Cominetti
, Mounir Haddou:
Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming. Math. Oper. Res. 22(1): 43-62 (1997) - Imre Bárány, Shmuel Onn
:
Colourful Linear Programming and its Relatives. Math. Oper. Res. 22(3): 550-567 (1997) - Petra Bauer:
The Circuit Polytope: Facets. Math. Oper. Res. 22(1): 110-145 (1997) - J. Frédéric Bonnans, Florian A. Potra:
On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems. Math. Oper. Res. 22(2): 378-407 (1997) - Sid Browne:
Survival and Growth with a Liability: Optimal Portfolio Strategies in Continuous Time. Math. Oper. Res. 22(2): 468-493 (1997) - Apostolos N. Burnetas
, Michael N. Katehakis:
Optimal Adaptive Policies for Markov Decision Processes. Math. Oper. Res. 22(1): 222-255 (1997) - Robert Carr:
Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time. Math. Oper. Res. 22(2): 257-265 (1997) - Emilio Carrizosa
, Eduardo Conde
, Manuel Muñoz-Márquez, Justo Puerto:
Simpson Points in Planar Problems with Locational Constraints. The Round-Norm Case. Math. Oper. Res. 22(2): 276-290 (1997) - Emilio Carrizosa
, Eduardo Conde
, Manuel Muñoz-Márquez, Justo Puerto:
Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case. Math. Oper. Res. 22(2): 291-300 (1997) - Hong Chen, Hanqin Zhang:
Stability of Multiclass Queueing Networks Under FIFO Service Discipline. Math. Oper. Res. 22(3): 691-725 (1997) - Jean-Pierre Crouzeix, Jacques A. Ferland, Constantin Zalinescu
:
α-Covex Sets and Strong Quasiconvexity. Math. Oper. Res. 22(4): 998-1022 (1997) - Martin E. Dyer
, Ravi Kannan:
On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension. Math. Oper. Res. 22(3): 545-549 (1997) - Ran El-Yaniv, Richard M. Karp:
Nearly Optimal Competitive Online Replacement Policies. Math. Oper. Res. 22(4): 814-839 (1997) - Sharon Filipowski:
On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data. Math. Oper. Res. 22(4): 769-792 (1997) - Luana E. Gibbons, Donald W. Hearn, Panos M. Pardalos, Motakuri V. Ramana:
Continuous Characterizations of the Maximum Clique Problem. Math. Oper. Res. 22(3): 754-768 (1997) - Paul Glasserman, Tai-Wen Liu:
Corrected Diffusion Approximations for a Multistage Production-Inventory System. Math. Oper. Res. 22(1): 186-201 (1997) - Andrew V. Goldberg, Alexander V. Karzanov:
Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost. Math. Oper. Res. 22(1): 90-109 (1997) - Donald Goldfarb, Zhiying Jin, James B. Orlin:
Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem. Math. Oper. Res. 22(4): 793-802 (1997) - Osman Güler:
Hyperbolic Polynomials and Interior Point Methods for Convex Programming. Math. Oper. Res. 22(2): 350-377 (1997) - Leslie A. Hall, Andreas S. Schulz
, David B. Shmoys
, Joel Wein:
Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms. Math. Oper. Res. 22(3): 513-544 (1997) - Sergiu Hart
, Dov Monderer:
Potentials and Weighted Values of Nonatomic Games. Math. Oper. Res. 22(3): 619-630 (1997) - L. R. Huang, K. F. Ng:
On Lower Bounds of the Second-Order Directional Derivatives of Ben-Tal, Zowe, and Chaney. Math. Oper. Res. 22(3): 747-753 (1997) - Carlos Humes Jr., J. Ou, P. R. Kumar:
The Delay of Open Markovian Queueing Networks: Uniform Functional Bounds, Heavy Traffic Pole Multiplicities, and Stability. Math. Oper. Res. 22(4): 921-954 (1997) - Satoru Iwata, Kazuo Murota, Maiko Shigeno:
A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences. Math. Oper. Res. 22(4): 803-813 (1997) - Jean-Yves Jaffray, Fabrice Philippe:
On the Existence of Subjective Upper and Lower Probabilities. Math. Oper. Res. 22(1): 165-185 (1997) - Krzysztof C. Kiwiel:
Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints. Math. Oper. Res. 22(2): 326-349 (1997)
skipping 17 more matches
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-08-27 21:21 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