default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 4
Volume 4, Number 1, 1973
- M. Sakarovitch:
Two commodity network flows and linear programming. 1-20 - L. Dekker:
Hybrid computation in mathematical programming. 21-43 - Klaus Ritter:
A superlinearly convergent method for minimization problems with linear inequality constraints. 44-71 - James P. Evans, Floyd J. Gould, Jon W. Tolle:
Exact penalty functions in nonlinear programming. 72-97 - Harold W. Kuhn:
A note on Fermat's problem. 98-107 - T. C. Hu:
Two-commodity cut-packing problem. 108-109 - Arie Tamir:
On a characterization of P-matrices. 110-112 - George L. Nemhauser, A. C. Williams, Sanjoy K. Mitter, Joseph T. Howson:
Book reviews. 113-118 - Richard James Duffin:
Convex analysis treated by linear programming. 125-143 - J. Asaadi:
A computational comparison of some non-linear programs. 144-154 - Gautam Mitra:
Investigation of some branch and bound strategies for the solution of mixed integer linear programs. 155-170 - G. Anthony Gorry, William D. Northup, Jeremy F. Shapiro:
Computational experience with a group theoretic integer programming algorithm. 171-192 - M. J. D. Powell:
On search directions for minimization algorithms. 193-201 - András Prékopa:
Contributions to the theory of stochastic programming. 202-221 - Laurence A. Wolsey:
Generalized dynamic programming methods in integer programming. 222-232 - Vijaykumar Aggarwal:
On the generation of all equilibrium points for bimatrix games through the Lemke - Howson Algorithm. 233-234 - Stanley Zionts:
Book reviews. 235-240 - R. W. H. Sargent, Bruce A. Murtagh:
Projection methods for non-linear programming. 245-268 - Fred W. Glover, Darwin Klingman:
On the equivalence of some generalized network problems to pure network problems. 269-278 - Leon S. Lasdon, Richard L. Fox, Margery W. Ratner:
An efficient one - dimensional search procedure for barrier functions. 279-296 - R. Gordon Cassidy, C. A. Field, W. R. S. Sutherland:
Inverse programming: Theory and examples. 297-308 - Melanie L. Lenard:
Practical convergence conditions for unconstrained optimization. 309-323 - Romesh Saigal, Carl Simon:
Generic properties of the complementarity problem. 324-335 - Katta G. Murty:
The graph of an abstract polytope. 336-346 - Maciej M. Syslo:
A new solvable case of the traveling salesman problem. 347-348 - Jorge J. Moré, Richard W. Cottle, Louis J. Billera, Mark J. Eisner:
Book reviews. 349-353
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 2025-12-04 01:28 CET 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:
