Остановите войну!
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 53 matches
- 2004
- Karen I. Aardal, Arjen K. Lenstra:
Hard Equality Constrained Integer Knapsacks. Math. Oper. Res. 29(3): 724-738 (2004) - Rajeev Agrawal, François Baccelli, Rajendran Rajan:
An Algebra for Queueing Networks with Time-Varying Service and Its Application to the Analysis of Integrated Service Networks. Math. Oper. Res. 29(3): 559-591 (2004) - Hatem Ben Ameur, Pierre L'Ecuyer, Christiane Lemieux:
Combination of General Antithetic Transformations and Control Variables. Math. Oper. Res. 29(4): 946-960 (2004) - Edward J. Anderson, Chris N. Potts:
Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time. Math. Oper. Res. 29(3): 686-697 (2004) - Alfred Auslender, Marc Teboulle:
Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization. Math. Oper. Res. 29(1): 1-26 (2004) - Christian Bender, Robert J. Elliott:
Arbitrage in a Discrete Version of the Wick-Fractional Black-Scholes Market. Math. Oper. Res. 29(4): 935-945 (2004) - Mine Çaglar:
A Long-Range Dependent Workload Model for Packet Data Traffic. Math. Oper. Res. 29(1): 92-105 (2004) - Robert D. Carr:
Separation Algorithms for Classes of STSP Inequalities Arising from a New STSP Relaxation. Math. Oper. Res. 29(1): 80-91 (2004) - Xin Chen, David Simchi-Levi:
Coordinating Inventory Control and Pricing Strategies with Random Demand and Fixed Ordering Cost: The Infinite Horizon Case. Math. Oper. Res. 29(3): 698-723 (2004) - Bong Dae Choi, Bara Kim, Dongbi Zhu:
MAP/M/c Queue with Constant Impatient Time. Math. Oper. Res. 29(2): 309-325 (2004) - José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses:
Selfish Routing in Capacitated Networks. Math. Oper. Res. 29(4): 961-976 (2004) - Jiangang Dai, Otis B. Jennings:
Stabilizing Queueing Networks with Setups. Math. Oper. Res. 29(4): 891-922 (2004) - Eric V. Denardo, Uriel G. Rothblum, Ludo van der Heyden:
Index Policies for Stochastic Search in a Forest with an Application to R&D Project Management. Math. Oper. Res. 29(1): 162-181 (2004) - Nico M. van Dijk, Masakiyo Miyazawa:
Error Bounds for Perturbing Nonexponential Queues. Math. Oper. Res. 29(3): 525-558 (2004) - R. T. Dunn, Kevin D. Glazebrook:
Discounted Multiarmed Bandit Problems on a Collection of Machines with Varying Speeds. Math. Oper. Res. 29(2): 266-279 (2004) - B. Curtis Eaves, Peter W. Glynn, Uriel G. Rothblum:
The Mean Number-in-System Vector Range for Multiclass Queueing Networks. Math. Oper. Res. 29(1): 182-190 (2004) - Vladimir Ejov, Jerzy A. Filar, Minh-Tuan Nguyen:
Hamiltonian Cycles and Singularly Perturbed Markov Chains. Math. Oper. Res. 29(1): 114-131 (2004) - Daniela Pucci de Farias, Benjamin Van Roy:
On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming. Math. Oper. Res. 29(3): 462-478 (2004) - Eugene A. Feinberg:
Continuous Time Discounted Jump Markov Decision Processes: A Discrete-Event Approach. Math. Oper. Res. 29(3): 492-524 (2004) - Sándor P. Fekete, Jörg Schepers:
A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing. Math. Oper. Res. 29(2): 353-368 (2004) - Serguei Foss, Artëm Sapozhnikov:
On the Existence of Moments for the Busy Period in a Single-Server Queue. Math. Oper. Res. 29(3): 592-601 (2004) - Alan M. Frieze:
On Random Symmetric Travelling Salesman Problems. Math. Oper. Res. 29(4): 878-890 (2004) - Refael Hassin, Asaf Levin:
Synthesis of 2-Commodity Flow Networks. Math. Oper. Res. 29(2): 280-288 (2004) - Alexander D. Ioffe, R. E. Lucchetti, Julian P. Revalski:
Almost Every Convex or Quadratic Programming Problem Is Well Posed. Math. Oper. Res. 29(2): 369-382 (2004) - Anna Jaskiewicz:
On the Equivalence of Two Expected Average Cost Criteria for Semi-Markov Control Processes. Math. Oper. Res. 29(2): 326-338 (2004) - Monique Jeanblanc, Peter Lakner, Ashay Kadam:
Optimal Bankruptcy Time and Consumption/Investment Policies on an Infinite Horizon with a Continuous Debt Repayment Until Bankruptcy. Math. Oper. Res. 29(3): 649-671 (2004) - Predrag R. Jelenkovic, Petar Momcilovic:
Large Deviations of Square Root Insensitive Random Sums. Math. Oper. Res. 29(2): 398-406 (2004) - Jianyong Liu, Xiaobo Zhao:
On Average Reward Semi-Markov Decision Processes with a General Multichain Structure. Math. Oper. Res. 29(2): 339-352 (2004) - Ramesh Johari, John N. Tsitsiklis:
Efficiency Loss in a Network Resource Allocation Game. Math. Oper. Res. 29(3): 407-435 (2004) - David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young:
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. Math. Oper. Res. 29(3): 436-461 (2004)
skipping 23 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-05-07 02:27 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