Остановите войну!
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 54 matches
- 2005
- Daniel Adelman, Diego Klabjan:
Duality and Existence of Optimal Policies in Generalized Joint Replenishment. Math. Oper. Res. 30(1): 28-50 (2005) - Felipe Alvarez, Miguel Carrasco, Karine Pichard:
Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization. Math. Oper. Res. 30(4): 966-984 (2005) - Edoardo Amaldi, Raphael Hauser:
Boundedness Theorems for the Relaxation Method. Math. Oper. Res. 30(4): 939-955 (2005) - Aram V. Arutyunov, Alexey F. Izmailov:
Sensitivity Analysis for Cone-Constrained Optimization Problems Under the Relaxed Constraint Qualifications. Math. Oper. Res. 30(2): 333-353 (2005) - R. Balaji, T. Parthasarathy, D. Sampangi Raman, Vellaichamy Vetrivel:
On the Lipschitz Continuity of the Solution Map in Semidefinite Linear Complementarity Problems. Math. Oper. Res. 30(2): 462-471 (2005) - Nikhil Bansal, Mohammad Mahdian, Maxim Sviridenko:
Minimizing Makespan in No-Wait Job Shops. Math. Oper. Res. 30(4): 817-831 (2005) - Fabián Flores Bazán, Rubén López:
The Linear Complementarity Problem Under Asymptotic Analysis. Math. Oper. Res. 30(1): 73-90 (2005) - Gustavo Bergantiños, Juan J. Vidal-Puga:
The Consistent Coalitional Value. Math. Oper. Res. 30(4): 832-851 (2005) - Sem C. Borst, Bert Zwart:
Fluid Queues with Heavy-Tailed M/G/ Input. Math. Oper. Res. 30(4): 852-879 (2005) - Alberto Caprara, Andrea Lodi, Michele Monaci:
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing. Math. Oper. Res. 30(1): 150-172 (2005) - Michael S. Casey, Suvrajeet Sen:
The Scenario Generation Algorithm for Multistage Stochastic Linear Programming. Math. Oper. Res. 30(3): 615-631 (2005) - Xiaojun Chen, Masao Fukushima:
Expected Residual Minimization Method for Stochastic Linear Complementarity Problems. Math. Oper. Res. 30(4): 1022-1038 (2005) - Maria B. Chiarolla, Ulrich G. Haussmann:
Explicit Solution of a Stochastic, Irreversible Investment Problem and Its Moving Threshold. Math. Oper. Res. 30(1): 91-108 (2005) - José R. Correa, Andreas S. Schulz:
Single-Machine Scheduling with Precedence Constraints. Math. Oper. Res. 30(4): 1005-1021 (2005) - Sanjeeb Dash:
Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs. Math. Oper. Res. 30(3): 678-700 (2005) - Supratim Deb, Sanjay Shakkottai, R. Srikant:
Asymptotic Behavior of Internet Congestion Controllers in a Many-Flows Regime. Math. Oper. Res. 30(2): 420-440 (2005) - Jean-Paul Décamps, Thomas Mariotti, Stéphane Villeneuve:
Investment Timing Under Incomplete Information. Math. Oper. Res. 30(2): 472-500 (2005) - Steftcho P. Dokov, David P. Morton:
Second-Order Lower Bounds on the Expectation of a Convex Function. Math. Oper. Res. 30(3): 662-677 (2005) - Ori Einstein, Refael Hassin:
The Number of Solutions Sufficient for Solving a Family of Problems. Math. Oper. Res. 30(4): 880-896 (2005) - Lisa Fleischer, Jay Sethuraman:
Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions. Math. Oper. Res. 30(4): 916-938 (2005) - Stephan Foldes, Peter L. Hammer:
Submodularity, Supermodularity, and Higher-Order Monotonicities of Pseudo-Boolean Functions. Math. Oper. Res. 30(2): 453-461 (2005) - Robert M. Freund, Fernando Ordóñez:
On an Extension of Condition Number Theory to Nonconic Convex Optimization. Math. Oper. Res. 30(1): 173-194 (2005) - Bruce E. Hajek, Pierre Seri:
Lex-Optimal Online Multiclass Scheduling with Hard Deadlines. Math. Oper. Res. 30(3): 562-596 (2005) - Warren L. Hare, Adrian S. Lewis:
Estimating Tangent and Normal Cones Without Calculus. Math. Oper. Res. 30(4): 785-799 (2005) - Yiran He, Jie Sun:
Error Bounds for Degenerate Cone Inclusion Problems. Math. Oper. Res. 30(3): 701-717 (2005) - Arie Hordijk, Dinard van der Laan:
On the Average Waiting Time for Regular Routing to Deterministic Queues. Math. Oper. Res. 30(2): 521-544 (2005) - Hui Hu:
Characterizations of the Strong Basic Constraint Qualifications. Math. Oper. Res. 30(4): 956-965 (2005) - Garud N. Iyengar:
Robust Dynamic Programming. Math. Oper. Res. 30(2): 257-280 (2005) - Dinard van der Laan:
Routing Jobs to Servers with Deterministic Service Times. Math. Oper. Res. 30(1): 195-224 (2005) - Jean B. Lasserre, Eduardo S. Zeron:
An Alternative Algorithm for Counting Lattice Points in a Convex Polytope. Math. Oper. Res. 30(3): 597-614 (2005)
skipping 24 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-23 22:46 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