default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 29
Volume 29, Number 1, May 1984
- Manfred Padberg, Laurence A. Wolsey:
Fractional covers for forests and matchings. 1-14 - Alexander Schrijver:
Proving total dual integrality with cross-free families - A general framework. 15-27 - Martin Grötschel, George L. Nemhauser:
A polynomial algorithm for the max-cut problem on graphs without long odd cycles. 28-40 - Gerald G. Brown, William G. Wright:
Automatic identification of embedded network rows in large-scale optimization models. 41-56 - Martin E. Dyer
:
An O(n) algorithm for the multiple-choice knapsack linear program. 57-63 - Albert G. Buckley:
Termination and equivalence results for conjugate gradient algorithms. 64-76 - B. Curtis Eaves:
Permutation congruent transformations of the freudenthal triangulation with minimum surface density. 77-99 - Sehun Kim:
Economic planning with institutional price constraints for a decentralized economy. 100-112 - Jeremy F. Shapiro:
A note on node aggregation and Benders' decomposition. 113-119
Volume 29, Number 2, June 1984
- Satoru Fujishige:
Structures of polyhedra determined by submodular functions on crossing families. 125-141 - Satoru Fujishige:
Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions. 142-155 - Mukund N. Thapa:
Optimization of unconstrained functions with sparse hessian matrices-newton-type methods. 156-186 - Ahmed Ech-Cherif, Joseph G. Ecker:
A class of rank-two ellipsoid algorithms for convex programming. 187-202 - Johannes Jahn:
Scalarization in vector optimization. 203-218 - Awanti P. Sethi, Gerald L. Thompson:
The pivot and probe algorithm for solving a linear program. 219-233 - Thomas F. Coleman, Danny C. Sorensen:
A note on the computation of an orthonormal basis for the null space of a matrix. 234-242 - Jean-Pierre Crouzeix, Jacques A. Ferland, Siegfried Schaible:
Duality in generalized linear fractional programming. 243
Volume 29, Number 3, July 1984
- Pradeep Dubey, Lloyd S. Shapley:
Totally balanced games arising from controlled programming problems. 245-267 - Per Lindström, Per-Åke Wedin:
A new linesearch algorithm for nonlinear least squares problems. 268-296 - M. J. D. Powell:
On the global convergence of trust region algorithms for unconstrained minimization. 297-303 - Richard E. Wendell:
Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis. 304-322 - Daniel Granot, Gur Huberman:
On the core and nucleolus of minimum cost spanning tree games. 323-347 - Satoru Fujishige:
On the subdifferential of a submodular function. 348-360
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 2024-11-22 19:33 CET 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:
