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 31 matches
- 1980
- Davis Avis:
A note on some computationally difficult set covering problems. Math. Program. 18(1): 138-145 (1980) - Imre Bárány:
Borsuk's theorem through complementary pivoting. Math. Program. 18(1): 84-88 (1980) - Mokhtar S. Bazaraa, C. M. Shetty, Jamie J. Goode:
On the convergence of a class of algorithms using linearly independent search directions. Math. Program. 18(1): 89-93 (1980) - Johannes Bisschop, Alexander Meeraus:
Matrix augmentation and structure preservation in linearly constrained control problems. Math. Program. 18(1): 7-15 (1980) - Jonathan M. Borwein:
A note on perfect duality and limiting lagrangeans. Math. Program. 18(1): 330-337 (1980) - Dennis L. Bricker:
Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual. Math. Program. 18(1): 68-83 (1980) - Yow-Yieh Chang, Richard W. Cottle:
Least-index resolution of degeneracy in quadratic programming. Math. Program. 18(1): 127-137 (1980) - Jean-Pierre Crouzeix:
On second order conditions for quasiconvexity. Math. Program. 18(1): 349-352 (1980) - Ulrich Eckhardt:
Weber's problem and weiszfeld's algorithm in general spaces. Math. Program. 18(1): 186-196 (1980) - Jan Eriksson:
A note on solution of large sparse maximum entropy problems with linear equality constraints. Math. Program. 18(1): 146-154 (1980) - Roger Fletcher, G. Alistair Watson:
First and second order conditions for a class of nondifferentiable optimization problems. Math. Program. 18(1): 291-307 (1980) - Stanley J. Garstka:
An economic interpretation of stochastic programs. Math. Program. 18(1): 62-67 (1980) - Donald Goldfarb:
Curvilinear path steplength algorithms for minimization which use directions of negative curvature. Math. Program. 18(1): 31-40 (1980) - Richard V. Helgason, Jeffery L. Kennington, H. S. Lall:
A polynomially bounded algorithm for a singly constrained quadratic program. Math. Program. 18(1): 338-343 (1980) - Krisorn Jittorntrum:
Accelerated convergence for the Powell/Hestenes multiplier method. Math. Program. 18(1): 197-214 (1980) - Moshe Kress, Arie Tamir:
The use of jacobi's lemma in unimodularity theory. Math. Program. 18(1): 344-348 (1980) - Gerard van der Laan, A. J. J. Talman:
An improvement of fixed point algorithms by using a good triangulation. Math. Program. 18(1): 274-285 (1980) - Daniel W. Litwhiler Jr., Adel A. Aly:
Steiner's problem and fagnano's result on the sphere. Math. Program. 18(1): 286-290 (1980) - T. H. Mattheiss, Brian K. Schmidt:
Computational results on an algorithm for finding all vertices of a polytope. Math. Program. 18(1): 308-329 (1980) - Richard D. McBride:
A bump triangular dynamic factorization algorithm for the simplex method. Math. Program. 18(1): 49-61 (1980) - Van Hien Nguyen, Jean-Jacques Strodiot, Robert Mifflin:
On conditions to have bounded multipliers in locally lipschitz programming. Math. Program. 18(1): 100-106 (1980) - Manfred Padberg:
(1, k)-configurations and facets for packing problems. Math. Program. 18(1): 94-99 (1980) - Quirino Paris:
Consistent aggregation of linear complementarity problems. Math. Program. 18(1): 41-48 (1980) - Ury Passy, Shaul Yutav:
Pseudo duality in mathematical programming: Unconstrained problems and problems with equality constraints. Math. Program. 18(1): 248-273 (1980) - André F. Perold:
A generalization of the Frank - Wolfe theorem. Math. Program. 18(1): 215-227 (1980) - Richard S. Sacher:
A decomposition algorithm for quadratic programming. Math. Program. 18(1): 16-30 (1980) - Daniel Solow:
Comparative computer results of a new complementary pivot algorithm for solving equality and inequality constrained optimization problems. Math. Program. 18(1): 169-185 (1980) - W. R. S. Sutherland:
Optimality in transient markov chains and linear programming. Math. Program. 18(1): 1-6 (1980) - Michael J. Todd:
A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization. Math. Program. 18(1): 111-126 (1980) - Michael J. Todd:
Exploiting structure in piecewise-linear homotopy algorithms for solving equations. Math. Program. 18(1): 233-247 (1980)
skipping 1 more match
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-10-11 18:35 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