![](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 52 matches
- 1980
- Robert M. Bell, Thomas M. Cover:
Competitive Optimality of Logarithmic Investment. Math. Oper. Res. 5(2): 161-166 (1980) - Robert E. Bixby, William H. Cunningham:
Converting Linear Programs to Network Problems. Math. Oper. Res. 5(3): 321-357 (1980) - Richard A. Brualdi, Jeffrey A. Ross:
On the Exponent of a Primitive, Nearly Reducible Matrix. Math. Oper. Res. 5(2): 229-241 (1980) - Jean-Pierre Crouzeix:
Conditions for Convexity of Quasiconvex Functions. Math. Oper. Res. 5(1): 120-125 (1980) - Pradeep Dubey:
Asymptotic Semivalues and a Short Proof of Kannai's Theorem. Math. Oper. Res. 5(2): 267-270 (1980) - Emad El-Neweihi:
A Relationship Between Partial Derivatives of the Reliability Function of a Coherent System and its Minimal Path (Cut) Sets. Math. Oper. Res. 5(4): 553-555 (1980) - Peter C. Fishburn:
Stochastic Dominance and Moments of Distributions. Math. Oper. Res. 5(1): 94-100 (1980) - Peter C. Fishburn:
Multilinear Expected Utility. Math. Oper. Res. 5(4): 502-509 (1980) - Marshall L. Fisher, Dorit S. Hochbaum:
Probabilistic Analysis of the Planar k-Median Problem. Math. Oper. Res. 5(1): 27-34 (1980) - Françoise Fogelman, Martine Quinzii:
Asymptotic Value of Mixed Games. Math. Oper. Res. 5(1): 86-93 (1980) - Satoru Fujishige
:
Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector. Math. Oper. Res. 5(2): 186-196 (1980) - Nagata Furukawa:
Characterization of Optimal Policies in Vector-Valued Markovian Decision Processes. Math. Oper. Res. 5(2): 271-279 (1980) - Jean-Louis Goffin:
The Relaxation Method for Solving Systems of Linear Inequalities. Math. Oper. Res. 5(3): 388-414 (1980) - Henry M. Goldberg:
Jackson's Conjecture on Earliest Due Date Scheduling. Math. Oper. Res. 5(3): 460-466 (1980) - Martin Grötschel:
On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets. Math. Oper. Res. 5(2): 285-292 (1980) - George J. Habetler, Michael M. Kostreva:
Sets of Generalized Complementarity Problems and P-Matrices. Math. Oper. Res. 5(2): 280-284 (1980) - Willem K. Klein Haneveld:
On the Behavior of the Optimal Value Operator of Dynamic Programming. Math. Oper. Res. 5(2): 308-320 (1980) - Sergiu Hart
:
Measure-Based Values of Market Games. Math. Oper. Res. 5(2): 197-228 (1980) - T. C. Hu, Frank Ruskey:
Circular Cuts in a Network. Math. Oper. Res. 5(3): 422-434 (1980) - Frank K. Hwang:
Maximum Wealth Trees. Math. Oper. Res. 5(4): 487-493 (1980) - Jeffrey M. Jaffe:
An Analysis of Preemptive Multiprocessor Job Scheduling. Math. Oper. Res. 5(3): 415-421 (1980) - Dieter Kalin:
On the Optimality of (σ, S) Policies. Math. Oper. Res. 5(2): 293-307 (1980) - Aram Kevorkian:
Erratum: The Principal Maxmin Matrix Transversal Strategy. Math. Oper. Res. 5(4): 602 (1980) - Victor Klee:
Combinatorial Optimization: What is the State of the Art. Math. Oper. Res. 5(1): 1-26 (1980) - Elon Kohlberg:
Invariant Half-Lines of Nonexpansive Piecewise-Linear Transformations. Math. Oper. Res. 5(3): 366-372 (1980) - M. Kojima, Romesh Saigal:
On the Relationship Between Conditions that Insure a PL Mapping is a Homeomorphism. Math. Oper. Res. 5(1): 101-109 (1980) - Naftali A. Langberg, Ramón V. León, James Lynch, Frank Proschan:
Extreme Points of the Class of Discrete Decreasing Failure Rate Life Distributions. Math. Oper. Res. 5(1): 35-42 (1980) - Peter Mani, David W. Walkup:
A 3-Sphere Counterexample to the Wv-Path Conjecture. Math. Oper. Res. 5(4): 595-598 (1980) - T. H. Matheiss, David S. Rubin:
A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets. Math. Oper. Res. 5(2): 167-185 (1980) - Garth P. McCormick:
Locating an Isolated Global Minimizer of a Constrained Nonconvex Program. Math. Oper. Res. 5(3): 435-443 (1980)
skipping 22 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-07-21 03:44 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