![](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 35 matches
- 1977
- Mike C. Bartholomew-Biggs:
The estimation of the hessian matrix in nonlinear least squares problems with non-zero residuals. Math. Program. 12(1): 67-80 (1977) - Mathilde Benveniste:
Testing for complete efficiency in a vector maximization problem. Math. Program. 12(1): 285-288 (1977) - Kenneth W. Brodlie
:
An assessment of two approaches to variable metric methods. Math. Program. 12(1): 344-355 (1977) - Rainer E. Burkard, Willi Hahn, Uwe Zimmermann:
An algebraic approach to assignment problems. Math. Program. 12(1): 318-327 (1977) - J. D. Buys, R. Gonin:
The use of augmented lagrangian functions for sensitivity analysis in nonlinear programming. Math. Program. 12(1): 281-284 (1977) - Christakis Charalambous:
Nonlinear least pth optimization and nonlinear programming. Math. Program. 12(1): 195-225 (1977) - Abraham Charnes, C. B. García, Carlton E. Lemke:
Constructive proofs of theorems relating to: F(x) = y, with applications. Math. Program. 12(1): 328-343 (1977) - Gery Daeninck, Yves Smeers:
Using shortest paths in some transshipment problems with concave costs. Math. Program. 12(1): 18-25 (1977) - Martin E. Dyer
, Les G. Proll:
An algorithm for determining all extreme points of a convex polytope. Math. Program. 12(1): 81-96 (1977) - Giorgio Gallo
, Aydin Ülkücü:
Bilinear programming: An exact algorithm. Math. Program. 12(1): 173-194 (1977) - Jean-Michel Gauthier, Gerard Ribière:
Experiments in mixed-integer linear programming using pseudo-costs. Math. Program. 12(1): 26-47 (1977) - Jacques Gauvin:
A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming. Math. Program. 12(1): 136-138 (1977) - Bezalel Gavish, Paul J. Schweitzer, Eliezer Shlifer:
The zero pivot phenomenon in transportation and assignment problems and its computational implications. Math. Program. 12(1): 226-240 (1977) - J. E. Gentle, Vincent A. Sposito, William J. Kennedy:
On some properties of L1 estimators. Math. Program. 12(1): 139-140 (1977) - Fred W. Glover:
Compact LP bases for a class of IP problems. Math. Program. 12(1): 102-109 (1977) - Donald Goldfarb:
Matrix factorizations in optimization of nonlinear functions subject to linear constraints - an addendum. Math. Program. 12(1): 279-280 (1977) - Donald Goldfarb, John K. Reid:
A practicable steepest-edge simplex algorithm. Math. Program. 12(1): 361-371 (1977) - Richard Grinold:
Finite horizon approximations of infinite horizon linear programs. Math. Program. 12(1): 1-17 (1977) - Antonio Guccione, Noriyoshi Oguchi:
A note on the necessary conditions for exact aggregation of linear programming models. Math. Program. 12(1): 133-135 (1977) - Ikuyo Kaneko:
Isotone solutions of parametric linear complementarity problems. Math. Program. 12(1): 48-59 (1977) - T. D. Lin, Richard S. H. Mah:
Hierarchical partition - a new optimal pivoting algorithm. Math. Program. 12(1): 260-278 (1977) - Freerk A. Lootsma, Harvey J. Greenberg:
Design and implementation of optimization software - International Summer School Organized by the Working Committee on Algorithms of the Mathematical Programming Society Sponsored by the Scientific Affairs Division of the North Atlantic Treaty Organization. Math. Program. 12(1): 149-150 (1977) - D. G. Mahajan, M. N. Vartak:
Generalization of some duality theorems in nonlinear programming. Math. Program. 12(1): 293-317 (1977) - Nimrod Megiddo:
On monotonicity in parametric linear complementarity problems. Math. Program. 12(1): 60-66 (1977) - Nimrod Megiddo:
A monotone complementarity problem with feasible solutions but no complementary solutions. Math. Program. 12(1): 131-132 (1977) - Nimrod Megiddo, Masakazu Kojima:
On the existence and uniqueness of solutions in nonlinear complementarity theory. Math. Program. 12(1): 110-130 (1977) - Larry Nazareth:
A family of variable metric updates. Math. Program. 12(1): 157-172 (1977) - Elmor L. Peterson:
The complementary unboundedness of dual feasible solution sets in convex programming. Math. Program. 12(1): 392-405 (1977) - Jean-Claude Picard, Maurice Queyranne:
On the integer-valued variables in the linear vertex packing problem. Math. Program. 12(1): 97-101 (1977) - M. J. D. Powell:
Quadratic termination properties of Davidon's new variable metric algorithm. Math. Program. 12(1): 141-147 (1977)
skipping 5 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-08-12 03:22 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