default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 49
Volume 49, 1991
- Charles E. Blair:
Representation for multiple right-hand sides. 1-5 - Clóvis C. Gonzaga:
Polynomial affine algorithms for linear programming. 7-21 - K. A. Ariyawansa:
Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms. 23-48 - Michele Conforti, M. R. Rao, Antonio Sassano
:
The equipartition polytope. I: Formulations, dimension and basic facets. 49-70 - Michele Conforti, M. R. Rao, Antonio Sassano:
The equipartition polytope. II: Valid inequalities and facets. 71-90 - S. Thomas McCormick:
Making sparse matrices sparser: Computational results. 91-111 - Dinh The Luc:
Recession cones and the domination property in vector optimization. 113-122 - Hubertus Th. Jongen, Diethard Klatte, Klaus Tammer:
Implicit functions and sensitivity of stationary points. 123-138 - M. Seetharama Gowda:
On Q-matrices. 139-141 - Irvin Lustig:
Feasibility issues in a primal-dual interior-point method for linear programming. 145-162 - Sylvia C. Boyd, William R. Pulleyblank:
Optimizing over the subtour polytope of the travelling salesman problem. 163-187 - M. J. D. Powell, Ya-Xiang Yuan:
A trust region algorithm for equality constrained optimization. 189-211 - Hidefumi Kawasaki:
Second order necessary optimality conditions for minimizing a sup-type function. 213-229 - Masao Fukushima:
A Successive quadratic programming method for a Class of constrained nonsmooth optimization problems. 231-251 - Kazuya Kamiya:
Computation of equilibria in an economy with increasing returns to scale technologies. 253-261 - Liqun Qi:
Quasidifferentials and maximal normal operators. 263-271 - Robert Mifflin:
On superlinear convergence in univariate nonsmooth minimization. 273-279 - Mark Hartmann, Leslie E. Trotter Jr.:
A topological characterization for closed sets under polar duality in Qn. 281-283 - Richard H. Byrd, Jorge Nocedal:
An analysis of reduced Hessian methods for constrained optimization. 285-323 - Donald Goldfarb, Shucheng Liu:
An O(n3L) primal interior point algorithm for convex quadratic programming. 325-340 - Florian Jarre:
On the convergence of the method of analytic centers when applied to convex quadratic programs. 341-358 - Sehun Kim, Hyunsil Ahn, Seong-Cheol Cho:
Variable target value subgradient method. 359-369 - Carmen Herrero, Jose A. Silva:
On the equivalence between strong solvability and strict semimonotonicity for some systems involving Z-functions. 371-379 - Hanif D. Sherali:
Capacitated, balanced, sequential location-allocation problems on chains and trees. 381-396 - Jorge J. Moré, Stephen A. Vavasis:
On the solution of concave knapsack problems. 397-411 - Richard Henry Frymuth Jackson, Paul T. Boggs, Stephen G. Nash, Susan Powell:
Guidelines for reporting results of computational experiments. Report of the ad hoc committee. 413-425 - Francisco E. Torres:
Linearization of mixed-integer products. 427-428
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-09 23:26 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:
