default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 47
Volume 47, 1990
- Yinyu Ye, Michael J. Todd:
Containing and Shrinking Ellipsoids in the Path-Following Algorithm. 1-9 - William J. Cook:
Cutting-Plane Proofs in Polynomial Space. 11-18 - Manfred Padberg, Giovanni Rinaldi
:
An Efficient Algorithm for the Minimum Capacity Cut Problem. 19-36 - Alfredo N. Iusem, Alvaro R. De Pierro:
On the Convergence Properties of Hildreth's Quadratic Programming Algorithm. 37-51 - Ya-Xiang Yuan:
On a Subproblem of Trust Region Algorithms for Constrained Optimization. 53-63 - Roland Durier:
On Pareto Optima, the Fermat-Weber Problem, and Polyhedral Gauges. 65-79 - James B. Orlin, John H. Vande Vate:
Solving the Linear Matroid Parity Problem as a Sequence of Matroid Intersection Problems. 81-106 - Alexander Shapiro:
On Differential Stability in Stochastic Programming. 107-116 - C. A. Tiahrt, Aubrey B. Poore:
A Bifurcation Analysis of the Nonlinear Parametric Programming Problem. 117-141 - Xiang-Sun Zhang, De-Gang Liu:
A Note on the Continuity of Solutions of Parametric Linear Programs. 143-153 - William J. Cook, Ravi Kannan, Alexander Schrijver:
Chvátal Closures for mixed Integer Programming Problems. 155-174 - Pravin M. Vaidya:
An Algorithm for Linear Programming which Requires O(((m+n)n2 + (m+n)1.5n)L) Arithmetic Operations. 175-201 - Abderrahim Jourani, Lionel Thibault:
Approximate Subdifferential and Metric Regularity: The Finite-Dimensional Case. 203-218 - Manfred Padberg, Giovanni Rinaldi:
Facet Identification for the Symmetric Traveling Salesman Polytope. 219-257 - Frieda Granot, Jadranka Skorin-Kapov:
Some Proximity and Sensitivity Results in Quadratic Integer Programming. 259-268 - Kaj Holmberg:
On the Convergence of Cross Decomposition. 269-296 - Achiya Dax:
A New Theorem of the Alternative. 297-299 - James V. Burke, Jorge J. Moré, Gerardo Toraldo:
Convergence Properties of Trust Region Methods for Linear and Convex Constraints. 305-336 - Kurt M. Anstreicher:
A Standard Form Variant, and Safeguarded Linesearch, for the Modified Karmarkar Algorithm. 337-351 - Donald Goldfarb, Jianxiu Hao:
A Primal Simplex Algorithm that Solves the Maximum Flow Problem in at most nm Pivots and O(n2m) Time. 353-365 - Martin Grötschel, Yoshiko Wakabayashi:
Facets of the Clique Partitioning Polytope. 367-387 - R. R. Merkovsky, D. E. Ward:
General Constraint Qualifications in Nondifferentiable Programming. 389-405 - Horand I. Gassmann:
MSLiP: A Computer Code for the Multistage Stochastic Linear Programming Problem. 407-423 - Michael J. Best, Nilotpal Chakravarti:
Active Set Algorithms for Isotonic Regression; A Unifying Framework. 425-439 - Jon Lee:
A Spectral Approach to Polyhedral Dimension. 441-459
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-12-23 00:32 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:
