Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 40
Volume 40, Numbers 1-3, January 1988
- Shih-Ping Han:
A successive projection method. 1-14 - Jonathan F. Bard:
Convex two-level optimization. 15-27 - Hiroshi Imai:
On the convexity of the multiplicative version of Karmarkar's potential function. 29-32 - Roger L. Tobin:
A variable dimension solution approach for the general spatial price equilibrium problem. 33-51 - Ali Ridha Mahjoub:
On the stable set polytope of a series-parallel graph. 53-57 - James Renegar:
A polynomial-time algorithm, based on Newton's method, for linear programming. 59-93 - Robin W. Chaney:
Second-order necessary conditions in semismooth optimization. 95-109 - David M. Gay:
A variant of Karmarkar's linear programming algorithm for problems in standard form. 111 - James Renegar:
Rudiments of an average case complexity theory for piecewise-linear path following algorithms. 113-163 - Fred W. Glover, Darwin Klingman:
Layering strategies for creating exploitable structure in linear and integer programs. 165-181 - Donald Goldfarb, Sanjay Mehrotra:
Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value. 183-195 - Alan J. Hoffman:
On greedy algorithms for series parallel graphs. 197-204 - Gerard G. L. Meyer:
Convergence of relaxation algorithms by averaging. 205-212 - Anthony V. Fiacco, Jerzy Kyparisis:
Computable bounds on parametric solutions of convex problems. 213-221 - Robert Mifflin:
An implementation of an algorithm for univariate minimization and an application to nested optimization. 223 - Bernhard Fleischmann:
A new class of cutting planes for the symmetric travelling salesman problem. 225-246 - Richard H. Byrd, Robert B. Schnabel, Gerald A. Shultz:
Approximate solution of the trust region problem by minimization over two-dimensional subspaces. 247-263 - Thomas F. Coleman:
A chordal preconditioner for large-scale optimization. 265-287 - Donald Goldfarb, Sanjay Mehrotra:
A relaxed version of Karmarkar's method. 289-315 - Yves Pochet, Laurence A. Wolsey:
Lot-size models with backlogging: Strong reformulations and cutting planes. 317-335
a service of 
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-07-05 21:14 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:
