Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 11
Volume 11, Number 1, 1976
- Ubaldo M. García-Palomares, Olvi L. Mangasarian:
Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems. 1-13 - Hiroshi Konno:
A cutting plane algorithm for solving bilinear programs. 14-27 - Peter C. Fishburn, William V. Gehrlein:
Win probabilities and simple majorities in probabilistic voting situations. 28-41 - M. J. D. Powell:
Some convergence properties of the conjugate gradient method. 42-49 - Janusz S. Kowalik, K. G. Ramakrishnan:
A numerically stable optimization method based on A homogeneous function. 50-66 - David Q. Mayne, Elijah Polak:
Feasible directions algorithms for optimization problems with equality and inequality constraints. 67-80 - Adi Ben-Israel, Aharon Ben-Tal:
On A characterization of optimality in convex programming. 81-88 - M. J. Rijckaert, X. M. Martens:
A condensation method for generalized geometric programming. 89-93 - Henry Gabbay:
A note on polyhedral sets having A least element. 94-96 - Richard A. Brualdi, Peter M. Gibson:
The assignment polytope. 97-101 - Philip Wolfe:
Nominations for Treasurer and Council. 102 - William H. Cunningham:
A network simplex method. 105-116 - Hiroshi Konno:
Maximization of A convex quadratic function under linear constraints. 117-127 - Philip Wolfe:
Finding the nearest point in A polytope. 128-149 - Alan M. Frieze
:
Shortest path algorithms for knapsack type problems. 150-157 - Laurence A. Wolsey:
Further facet generating procedures for vertex packing polytopes. 158-163 - David B. Weinberger:
Transversal matroid intersections and related packings. 164-176 - John A. Lawrence:
A dual decomposition algorithm. 177-193 - S. C. Parikh:
Approximate cutting planes in nonlinear programming. 194-198 - Leonid V. Kantorovich:
Mathematics in economics: Achievements, difficulties, perspectives - Nobel Memorial Lecture - 11 December 1975. 204-211 - Tjalling C. Koopmans:
Concepts of optimality and their uses - Nobel Memorial Lecture - 11 December 1975. 212-228 - Marshall L. Fisher:
A dual algorithm for the one-machine scheduling problem. 229-251 - Floyd J. Gould, Jon W. Tolle:
An existence theorem for solutions to f(x) = 0. 252-262 - Shih-Ping Han:
Superlinearly convergent variable metric algorithms for general nonlinear programming problems. 263-282 - Jonathan M. Borwein:
Fractional programming without differentiability. 283-290 - Robert S. Garfinkel, Mendu Rao:
Bottleneck linear programming. 291-298 - Michael Bastian:
Another note on bimatrix games. 299-300
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-05-10 18:47 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:
