Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 39
Volume 39, Number 1, September 1987
- John E. Dennis Jr., A. M. Morshedi, Kathryn Turner:
A variable-metric variant of the Karmarkar algorithm for linear programming. 1-20 - R. Chandrasekaran, Jong-Shi Pang, Richard E. Stone:
Two counterexamples on the polynomial solvability of the linear complementarity problem. 21-25 - Alexander H. G. Rinnooy Kan, G. T. Timmer:
Stochastic global optimization methods part I: Clustering methods. 27-56 - Alexander H. G. Rinnooy Kan, G. T. Timmer:
Stochastic global optimization methods part II: Multi level methods. 57-78 - Guy de Ghellinck, Jean-Philippe Vial:
An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex. 79-92 - Paul H. Calamai, Jorge J. Moré:
Projected gradient methods for linearly constrained problems. 93-116
Volume 39, Number 2, June 1987
- Katta G. Murty, Santosh N. Kabadi:
Some NP-complete problems in quadratic and nonlinear programming. 117-129 - Leon S. Lasdon, John C. Plummer, B. Buehler, Allan D. Waren:
Optimal design of efficient acoustic antenna arrays. 131-155 - Peter L. Jackson, David F. Lynch:
Revised dantzig-wolfe decomposition for staircase-structured linear programs. 157-179 - Immo Diener:
On the global convergence of path-following methods to determine all solutions to a system of nonlinear equations. 181-188 - Aubrey B. Poore, C. A. Tiahrt:
Bifurcation problems in nonlinear parametric programming. 189-205 - Marc E. Posner, Hisatoshi Suzuki:
A dual approach for the continuous collapsing knapsack problem. 207-214 - Monique Guignard, Siwhan Kim:
Lagrangean decomposition: A model yielding stronger lagrangean bounds. 215-228
Volume 39, Number 3, October 1987
- Robert E. Bixby, Odile M.-C. Marcotte, Leslie E. Trotter Jr.:
Packing and covering with integral feasible flows in integral supply-demand networks. 231-239 - T. M. Doup, Gerard van der Laan, A. J. J. Talman:
The (2n+1-2)-ray algorithm: A new simplicial algorithm to compute economic equilibria. 241-252 - Aparna Ramanathan, Charles J. Colbourn:
Counting almost minimum cutsets with reliability applications. 253-261 - Anantaram Balakrishnan:
LP extreme points and cuts for the fixed-charge network design problem. 263-284 - Jerzy Kyparisis, Anthony V. Fiacco:
Generalized convexity and concavity of the optimal value function in nonlinear programming. 285-304 - Yinyu Ye, Masakazu Kojima:
Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming. 305-317 - Christian Michelot, Odile Lefebvre:
A primal-dual algorithm for the fermat-weber problem involving mixed gauges. 319-335 - Marco A. Duran, Ignacio E. Grossmann:
An outer-approximation algorithm for a class of mixed-integer nonlinear programs. 337 - Michel L. Balinski:
Nominations for 1988 elections. 339
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-06-19 21:55 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:
