default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 22
Volume 22, Number 1, 1982
- Rick Giles:
Optimum matching forests I: Special weights. 1-11 - Rick Giles:
Optimum matching forests II: General weights. 12-38 - Rick Giles:
Optimum matching forests III: Facets of matching forest polyhedra. 39-51 - Denis Naddef:
Rank of maximum matchings in a graph. 52-70 - Jørgen Tind, Laurence A. Wolsey:
On the use of penumbras in blocking and antiblocking theory. 71-81 - Jonathan E. Spingarn:
On optimality conditions for structured families of nonlinear programming problems. 82-92 - Jean-Louis Goffin:
On the non-polynomiality of the relaxation method for systems of linear inequalities. 93-103 - Antanas Zilinskas:
Axiomatic approach to statistical models and their use in multimodal optimization theory. 104-116 - Masataka Nakamura:
Boolean sublattices connected with minimization problems on matroids. 117-120 - Jean-Claude Picard, Maurice Queyranne:
On the structure of all minimum cuts in a network and applications. 121 - Bernhard Korte:
XI. International Symposium on Mathematical Programming - August 23-27, 1982 at the University of Bonn, W. Germany. 122-123 - C. G. E. Boender, A. H. G. Rinnooy Kan, G. T. Timmer, Leen Stougie:
A stochastic method for global optimization. 125-140 - Stephen Baum, Leslie E. Trotter Jr.:
Finite checkability for integer rounding properties in combinatorial programming problems. 141-147 - Dorit S. Hochbaum:
Heuristics for the fixed cost median problem. 148-162 - J. E. Fattler, Gintaras V. Reklaitis, Y. T. Sin, R. R. Root, K. M. Ragsdell:
On the computational utility of posynomial geometric programming solution methods. 163-201 - Robin W. Chaney:
A method of centers algorithm for certain minimax problems. 202-226 - Zvi Drezner:
On minimax optimization problems. 227-230 - James B. Orlin
:
A polynomial algorithm for integer programming covering problems satisfying the integer round-up property. 231-235 - Jean-Louis Goffin:
Convergence of a cyclic ellipsoid algorithm for systems of linear equalities. 239-260 - Regina Benveniste:
Evaluating computational efficiency: A stochastic approach. 261-287 - Achiya Dax:
Partial pivoting strategies for symmetric gaussian elimination. 288-303 - R. Chandrasekaran, Arie Tamir:
Polynomially bounded algorithms for locating p-centers on a tree. 304-315 - John J. Jarvis, Süleyman Tüfekci:
Decomposition algorithms for locating minimal cuts in a network. 316-331 - Rafael Lazimy:
Mixed-integer quadratic programming. 332-349 - Daniel Granot, Frieda Granot, Willem Vaessen:
An accelerated covering relaxation algorithm for solving 0-1 positive polynomial programs. 350-357
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.
last updated on 2025-05-09 19:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
