Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 6
Volume 6, Number 1, 1974
- Delbert Ray Fulkerson:
Packing rooted directed cuts in a weighted directed graph. 1-13 - Charles A. Holloway:
An extension of the frank and Wolfe method of feasible directions. 14-27 - C. R. Gagnon, R. H. Hicks, S. L. S. Jacoby, Janusz S. Kowalik:
A nonlinear programming approach to a very large hydroelectric system optimization. 28-41 - John A. Tomlin:
On pricing and backward transformation in linear programming. 42-47 - George L. Nemhauser, Leslie E. Trotter Jr.:
Properties of vertex packing and independence system polyhedra. 48-61 - Michael Held, Philip Wolfe, Harlan P. Crowder:
Validation of subgradient optimization. 62-88 - I. Norman Katz:
Local convergence in Fermat's problem. 89-104 - Robert G. Jeroslow:
Trivial integer programs unsolvable by branch-and-bound. 105-109 - Hans S. Witsenhausen:
On the limit of multiple packings. 110-113 - John J. Dinkel, Gary A. Kochenberger:
On "a cofferdam design optimization". 114-116 - James K. Ho, Alan Manne:
Nested decomposition for dynamic models. 121-140 - James H. Bigelow, Norman Z. Shapiro:
Implicit function theorems for mathematical programming and for systems of inequalities. 141-156 - Jørgen Tind:
Blocking and antiblocking sets. 157-166 - V. A. Sposito:
Modified regularity conditions for nonlinear programming problems over mixed cone domains. 167-179 - Manfred W. Padberg:
Perfect zero-one matrices. 180-196 - Nicos Christofides, P. Brooker:
Optimal expansion of an existing network. 197-211 - Ronald D. Armstrong, Prabhakant Sinha:
Improved penalty calculations for a mixed integer branch-and-bound algorithm. 212-223 - F. E. Davis, M. D. Devine, R. P. Lutz:
Scheduling activities among conflicting facilities to minimize conflict cost. 224-228 - Andreu Mas-Colell
:
A note on a theorem of F. Browder. 229-233 - Michael J. Todd:
A generalized complementary pivoting algorithm. 243-263 - Elijah Polak:
A modified secant method for unconstrained minimization. 264-280 - Marshall L. Fisher, Floyd J. Gould:
A simplicial algorithm for the nonlinear complementarity problem. 281-300 - Robert L. Armacost, Anthony V. Fiacco:
Computational experience in sensitivity analysis for nonlinear programming. 301-326 - Jorge J. Moré:
Classes of functions and feasibility conditions in nonlinear complementarity problems. 327-338 - Stanley J. Garstka:
Distribution functions in stochastic programs with recourse: A parametric analysis. 339-351 - Alan J. Hoffman:
A generalization of max flow - min cut. 352-359 - Carl-Louis Sandblom:
On the convergence of SUMT. 360-364 - Cary Swoveland:
A note on column generation in Dantzig - Wolfe decomposition algorithms. 365-370
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:
