![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 37 matches
- 1979
- Richard Asmuth, B. Curtis Eaves, Elmor L. Peterson:
Computing Economic Equilibria on Affine Networks with Lemke's Algorithm. Math. Oper. Res. 4(3): 209-214 (1979) - M. L. Balinski, H. Peyton Young:
Quotatone Apportionment Methods. Math. Oper. Res. 4(1): 31-38 (1979) - Michael O. Ball, George L. Nemhauser:
Matroids and a Reliability Analysis Problem. Math. Oper. Res. 4(2): 132-143 (1979) - Vasek Chvátal:
A Greedy Heuristic for the Set-Covering Problem. Math. Oper. Res. 4(3): 233-235 (1979) - W. H. Cunningham:
Theoretical Properties of the Network Simplex Method. Math. Oper. Res. 4(2): 196-208 (1979) - Eric V. Denardo, Uriel G. Rothblum:
Overtaking Optimality for Markov Decision Chains. Math. Oper. Res. 4(2): 144-152 (1979) - Cyrus Derman, D. R. Smith:
Renewal Decision Problem-Random Horizon. Math. Oper. Res. 4(3): 225-232 (1979) - Luc Devroye:
Inequalities for the Completion Times of Stochastic PERT Networks. Math. Oper. Res. 4(4): 441-447 (1979) - Pradeep Dubey, Lloyd S. Shapley:
Mathematical Properties of the Banzhaf Power Index. Math. Oper. Res. 4(2): 99-131 (1979) - Joyce J. Elam, Fred W. Glover
, Darwin Klingman:
A Strongly Convergent Primal Simplex Algorithm for Generalized Networks. Math. Oper. Res. 4(1): 39-59 (1979) - C. B. García, Willard I. Zangwill:
Determining All Solutions to Certain Systems of Nonlinear Equations. Math. Oper. Res. 4(1): 1-14 (1979) - C. B. García, Willard I. Zangwill:
An Approach to Homotopy and Degree Theory. Math. Oper. Res. 4(4): 390-405 (1979) - Jacques Gauvin:
The Generalized Gradient of a Marginal Function in Mathematical Programming. Math. Oper. Res. 4(4): 458-463 (1979) - Shih-Ping Han:
Penalty Lagrangian Methods Via a Quasi-Newton Approach. Math. Oper. Res. 4(3): 291-302 (1979) - Jean-Baptiste Hiriart-Urruty:
Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces. Math. Oper. Res. 4(1): 79-97 (1979) - Aram K. Kevorkian:
The Principal Maxmin Matrix Transversal Strategy. Math. Oper. Res. 4(3): 274-290 (1979) - Masakazu Kojima:
A Complementary Pivoting Approach to Parametric Nonlinear Programming. Math. Oper. Res. 4(4): 464-477 (1979) - Eugene L. Lawler:
Fast Approximation Algorithms for Knapsack Problems. Math. Oper. Res. 4(4): 339-356 (1979) - O. L. Mangasarian:
Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs. Math. Oper. Res. 4(3): 268-273 (1979) - Michael Maschler, Bezalel Peleg, L. S. Shapley:
Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts. Math. Oper. Res. 4(4): 303-338 (1979) - Nimrod Megiddo:
Combinatorial Optimization with Rational Objective Functions. Math. Oper. Res. 4(4): 414-424 (1979) - Nimrod Megiddo, Zvi Galil:
On Fulkerson's Conjecture About Consistent Labeling Processes. Math. Oper. Res. 4(3): 265-267 (1979) - Douglas R. Miller:
Almost Sure Comparisons of Renewal Processes and Poisson Processes, with Application to Reliability Theory. Math. Oper. Res. 4(4): 406-413 (1979) - Clyde L. Monma, Jeffrey B. Sidney:
Sequencing with Series-Parallel Precedence Constraints. Math. Oper. Res. 4(3): 215-224 (1979) - Abraham Neyman, Yair Tauman:
The Partition Value. Math. Oper. Res. 4(3): 236-264 (1979) - Boris G. Pittel:
Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis. Math. Oper. Res. 4(4): 357-378 (1979) - Martin L. Puterman, Shelby L. Brumelle:
On the Convergence of Policy Iteration in Stationary Dynamic Programming. Math. Oper. Res. 4(1): 60-69 (1979) - Sartaj Sahni, Yookun Cho:
Complexity of Scheduling Shops with No Wait in Process. Math. Oper. Res. 4(4): 448-457 (1979) - Romesh Saigal:
On Piecewise Linear Approximations to Smooth Mappings. Math. Oper. Res. 4(2): 153-161 (1979) - Helmut Schellhaas:
Semi-Regenerative Processes with Unbounded Rewards. Math. Oper. Res. 4(1): 70-78 (1979)
skipping 7 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.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-20 04:06 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