default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 26
Volume 26, Number 1, May 1983
- Michael J. Todd:
Large-scale linear programming: Geometry, working bases and factorizations. 1-20 - Robert R. Meyer:
Computational aspects of two-segment separable programming. 21-39 - Stella Dafermos:
An iterative scheme for variational inequalities. 40-47 - R. Kipp Martin, Dennis J. Sweeney:
An ideal column algorithm for integer programs with special ordered sets of variables. 48-63 - Patricia J. Carstensen:
Complexity of some parametric integer and network programming problems. 64-75 - Marc E. Posner:
The continuous collapsing Knapsack problem. 76-86 - Stephen J. Grotzinger:
On characterizing L1-supports, natural and Chebyshev approximates. 87-99 - Gur Huberman:
Error bounds for the aggregated convex programming problem. 100-108 - Shlomo Halfin:
The sphere method and the robustness of the ellipsoid algorithm. 109-116
Volume 26, Number 2, June 1983
- Gilbert Strang:
Maximal flow through a domain. 123-143 - Kaoru Tone:
Revisions of constraint approximations in the successive QP method for nonlinear programming problems. 144-152 - S. Thomas McCormick:
Optimal approximation of sparse hessians and its equivalence to a graph coloring problem. 153-171 - W. B. van Dam, J. B. G. Frenk
, Jan Telgen:
Randomly generated polytopes for testing mathematical programming algorithms. 172-181 - William H. Cunningham, John G. Klincewicz:
On cycling in the network simplex method. 182-189 - Ron S. Dembo, Trond Steihaug:
Truncated-newtono algorithms for large-scale unconstrained optimization. 190-212 - Pierre Loridan, Jacqueline Morgan:
Penalty functions in ε-programming and ε-minimax problems. 213-231 - Sándor Komlósi:
Some properties of nondifferentiable pseudoconvex functions. 232-237 - Paul H. Zipkin, K. Raimer:
An improved disaggregation method for transportation problems. 238-242
Volume 26, Number 3, October 1983
- R. Tyrrell Rockafellar:
Marginal values and second-order necessary conditions for optimality. 245-286 - Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank:
Halin graphs and the travelling salesman problem. 287-294 - Byong-Hun Ahn:
Iterative methods for linear complementarity problems with upperbounds on primary variables. 295-315 - John R. Birge, Akli Gana:
Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's. 316-325 - Ralph E. Steuer, Eng Ung Choo:
An interactive weighted Tchebycheff procedure for multiple objective programming. 326-344 - Toshihide Ibaraki:
Parametric approaches to fractional programs. 345-362
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-10-18 19:32 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:
