Остановите войну!
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 41 matches
- 2000
- Karen I. Aardal, Cor A. J. Hurkens, Arjen K. Lenstra:
Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables. Math. Oper. Res. 25(3): 427-442 (2000) - Eitan Altman, Bruno Gaujal, Arie Hordijk:
Multimodularity, Convexity, and Optimization Properties. Math. Oper. Res. 25(2): 324-347 (2000) - Kurt M. Anstreicher:
The Volumetric Barrier for Semidefinite Programming. Math. Oper. Res. 25(3): 365-380 (2000) - Laura S. Aragone, Roberto L. V. González:
A Fast Computational Procedure to Solve the Multi-Item Single Machine Lot Scheduling Optimization Problem: The Average Cost Case. Math. Oper. Res. 25(3): 455-475 (2000) - Mourad Baïou, Francisco Barahona, Ali Ridha Mahjoub:
Separation of Partition Inequalities. Math. Oper. Res. 25(2): 243-254 (2000) - Alok Baveja, Aravind Srinivasan:
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems. Math. Oper. Res. 25(2): 255-280 (2000) - J. Frédéric Bonnans, Mounir Haddou:
Asymptotic Analysis of Congested Communication Networks. Math. Oper. Res. 25(3): 409-426 (2000) - Rolando Cavazos-Cadena, Eugene A. Feinberg, Raúl Montes-de-Oca:
A Note on the Existence of Optimal Policies in Total Reward Dynamic Programs with Compact Action Sets. Math. Oper. Res. 25(4): 657-666 (2000) - Hong Chen, Hanqin Zhang:
Diffusion Approximations for Some Multiclass Queueing Networks with FIFO Service Disciplines. Math. Oper. Res. 25(4): 679-707 (2000) - J. H. Crosbie, Kevin D. Glazebrook:
Index Policies and a Novel Performance Space Structure for a Class of Generalised Branching Bandit Problems. Math. Oper. Res. 25(2): 281-297 (2000) - Ivonne Diaz-Rivera, Dieter Armbruster, Tom Taylor:
Periodic Orbits in a Class of Re-Entrant Manufacturing Systems. Math. Oper. Res. 25(4): 708-725 (2000) - Eugene A. Feinberg:
Constrained Discounted Markov Decision Processes and Hamiltonian Cycles. Math. Oper. Res. 25(1): 130-140 (2000) - Michel Grabisch, Jean-Luc Marichal, Marc Roubens:
Equivalent Representations of Set Functions. Math. Oper. Res. 25(2): 157-178 (2000) - Xianping Guo, Jianyong Liu, Ke Liu:
Nonhomogeneous Markov Decision Processes with Borel State Space-The Average Criterion with Nonuniformly Bounded Rewards. Math. Oper. Res. 25(4): 667-678 (2000) - Ori Haimanko:
Partially Symmetric Values. Math. Oper. Res. 25(4): 573-590 (2000) - Ori Haimanko:
Nonsymmetric Values of Nonatomic and Mixed Games. Math. Oper. Res. 25(4): 591-605 (2000) - Bruce Hoppe, Éva Tardos:
The Quickest Transshipment Problem. Math. Oper. Res. 25(1): 36-62 (2000) - Alfredo N. Iusem, Renato D. C. Monteiro:
On Dual Convergence of the Generalized Proximal Point Method with Bregman Distances. Math. Oper. Res. 25(4): 606-624 (2000) - Yakar Kannai, Myrna Holtz Wooders:
A Further Extension of the KKMS Theorem. Math. Oper. Res. 25(4): 539-551 (2000) - Claire Kenyon, Eric Rémila:
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem. Math. Oper. Res. 25(4): 645-656 (2000) - Adam N. Letchford:
Separating a Superclass of Comb Inequalities in Planar Graphs. Math. Oper. Res. 25(3): 443-454 (2000) - Viliam Makis, X. Jiang, K. Cheng:
Optimal Preventive Replacement Under Minimal Repair And Random Repair Cost. Math. Oper. Res. 25(1): 141-156 (2000) - Igal Milchtaich:
Generic Uniqueness of Equilibrium in Large Crowding Games. Math. Oper. Res. 25(3): 349-364 (2000) - Ilya S. Molchanov, Sergei A. Zuyev:
Variational Analysis of Functionals of Poisson Processes. Math. Oper. Res. 25(3): 485-508 (2000) - Renato D. C. Monteiro, Paulo R. Zanjácomo:
General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems. Math. Oper. Res. 25(3): 381-399 (2000) - Martin Mundhenk:
The Complexity of Optimal Small Policies. Math. Oper. Res. 25(1): 118-129 (2000) - Andreas Nolte, Rainer Schrader:
A Note on the Finite Time Behavior of Simulated Annealing. Math. Oper. Res. 25(3): 476-484 (2000) - Daniel Ralph, Stephen J. Wright:
Superlinear Convergence of an Interior-Point Method Despite Dependent Constraints. Math. Oper. Res. 25(2): 179-194 (2000) - S. Ramasubramanian:
A Subsidy-Surplus Model and the Skorokhod Problem in an Orthant. Math. Oper. Res. 25(3): 509-538 (2000) - Simeon Reich, Alexander J. Zaslavski:
Generic Convergence of Descent Methods in Banach Spaces. Math. Oper. Res. 25(2): 231-242 (2000)
skipping 11 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-07-10 20:28 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