Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 43
Volume 43, Numbers 1-3, January 1989
- Sunil Chopra, David L. Jensen, Ellis L. Johnson:
Polyhedra of regularp-nary group problems. 1-29 - Robert J. Vanderbei:
Affine-scaling for linear programs with free variables. 31-44 - Gérard Cornuéjols, Antonio Sassano
:
On the 0, 1 facets of the set covering polytope. 45-55 - Egon Balas, Shu Ming Ng:
On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}. 57-69 - Bernard F. Lamond:
A generalized inverse method for asymptotic linear programming. 71-86 - Ahmed Ech-Cherif, Joseph G. Ecker, Michael Kupferschmid:
A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming. 87-95 - Richard J. Caron, J. Fred McDonald:
A new approach to the analysis of random methods for detecting necessary linear inequality constraints. 97-102 - Balasubramanian Ram, Mark H. Karwan:
A result in surrogate duality for certain integer programming problems. 103-106 - Masakazu Kojima, Shinji Mizuno, Toshihito Noma:
A new continuation method for complementarity problems with uniformP-functions. 107-113 - Robert Mifflin, Jean-Jacques Strodiot:
A bracketing technique to ensure desirable convergence in univariate minimization. 117-130 - John R. Birge, Roger J.-B. Wets:
Sublinear upper bounds for stochastic programs with recourse. 131-149 - Clóvis C. Gonzaga:
Conical projection algorithms for linear programming. 151-173 - Faruk Güder:
Pairwise reactive sor algorithm for quadratic programming of net import spatial equilibrium models. 175-186 - Guangye Li:
Successive column correction algorithms for solving sparse nonlinear systems of equations. 187-207 - Kurt M. Anstreicher:
A combined phase I-phase II projective algorithm for linear programming. 209-223 - Lyle Noakes:
Fitting maps of the plane to experimental data. 225-234 - Roger Fletcher, Eduardo Sáinz de la Maza:
Nonlinear programming and nonsmooth optimization by successive linear programming. 235-256 - Michael C. Ferris, Andrew B. Philpott:
An interior point algorithm for semi-infinite linear programming. 257-276 - James V. Burke, Shih-Ping Han:
A robust sequential quadratic programming method. 277-303 - Sarah M. Ryan, James C. Bean:
Degeneracy in infinite horizon optimization. 305-316 - Nitin R. Patel, Robert L. Smith, Zelda B. Zabinsky:
Pure adaptive search in monte carlo optimization. 317-328 - Moshe Sniedovich:
Analysis of a class of fractional programming problems. 329-347 - Jean-Charles Bernard, Jacques A. Ferland:
Convergence of interval-type algorithms for generalized fractional programming. 349-363
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-04-19 20:18 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:
