Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 15
Volume 15, Number 1, 1978
- Balder Von Hohenbalken:
Least distance methods for the scheme of polytopes. 1-11 - Ron S. Dembo, Mordecai Avriel:
Optimal design of a membrane separation process using signomial programming. 12-25 - Richard Grinold:
Optimal design of a manpower system. 26-35 - Israel Zang:
A new arc algorithm for unconstrained optimization. 36-52 - François V. Louveaux:
Piecewise convex programs. 53-62 - Joseph L. Balintfy, G. Terry Ross, Prabhakant Sinha, Andris A. Zoltners:
A mathematical programming system for preference and compatibility maximized menu planning and scheduling. 63-76 - Uriel G. Rothblum:
On solving optimization problems with proportion-constraints. 77-86 - Charles E. Blair:
Convex optimization and lagrange multipliers. 87-91 - James R. Evans:
On equivalent representations of certain multicommodity networks as single commodity flow problems. 92-99 - John A. Lawrence:
Abstract polytopes and the hirsch conjecture. 100-104 - André F. Perold:
An alternative method for a global analysis of quadratic programs in a finite number of steps. 105-109 - C. B. García, Floyd J. Gould:
A note on a theorem of Yamamuro. 110-113 - Emilio Spedicato:
On a conjecture of Dixon and other topics in variable metric methods. 123-129 - Jacques A. Chatelon, Donald W. Hearn, Timothy J. Lowe:
A subgradient algorithm for certain minimax and minisum problems. 130-145 - Ikuyo Kaneko:
A parametric linear complementarity problem involving derivatives. 146-154 - Marc E. Posner, Monique Guignard:
The Collapsing 0-1 Knapsack Problem. 155-161 - Hisatoshi Suzuki:
A generalized knapsack problem with variable coefficients. 162-176 - P. Miliotis:
Using cutting planes to solve the symmetric Travelling Salesman problem. 177-188 - Michael J. Best:
A quasi-Newton method can be obtained from a method of conjugate directions. 189-199 - Albert G. Buckley:
A combined conjugate-gradient quasi-Newton minimization algorithm. 200-210 - Joseph A. Svestka:
A continuous variable representation of the traveling salesman problem. 211-213 - Joseph J. M. Evers:
More with the Lemke complementarity algorithm. 214-219 - Dieter Kalin:
A note on 'monotone optimal policies for markov decision processes'. 220-222 - Masakazu Kojima:
A modification of todd's triangulation J3. 223-227 - Yoshitsugu Yamamoto:
The Held - Karp algorithm and degree-constrained minimum 1-trees. 228-231 - Olvi L. Mangasarian, W. R. S. Sutherland:
Solution of the linear inverse vector optimization problem by a single linear program. 232-235 - Dominique de Werra:
On line perfect graphs. 236-238 - Thomas F. Coleman:
A note on 'new algorithms for constrained minimax optimization'. 239-242 - Robert B. Schnabel:
Optimal conditioning in the convex class of rank two updates. 247-260 - John J. Dinkel, Gary A. Kochenberger:
An implementation of some implicit function theorems with applications to sensitivity analysis. 261-267 - Eitan Zemel:
Lifting the facets of zero-one polytopes. 268-277 - Christakis Charalambous:
A lower bound for the controlling parameters of the exact penalty functions. 278-290 - John M. Mulvey:
Testing of a large-scale network optimization program. 291-314 - Michel L. Balinski:
On the reporting of computational experiments. 315 - Harlan P. Crowder, Ron S. Dembo, John M. Mulvey:
Reporting computational experiments in mathematical programming. 316-329 - Luc Devroye:
Progressive global random search of continuous functions. 330-342 - Albert G. Buckley:
Extending the relationship between the conjugate gradient and BFGS algorithms. 343-348 - R. C. Daniel:
A note on Schrage's generalised variable upper bounds. 349-351 - William P. Niedringhaus, Kenneth Steiglitz:
Some experiments with the pathological linear programs of N. Zadeh. 352-354 - Patrick G. McKeown:
Some computational results of using the Ahrens - Finke method for handling degeneracy in fixed charge transportation problems. 355-359 - Marc E. Posner:
The decomposition of nonlinear problems. 360-362
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-18 21:17 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:
