Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 3
Volume 3, Number 1, December 1972
- B. Curtis Eaves:
Homotopies for computation of fixed points. 1-22 - Ralph E. Gomory, Ellis L. Johnson:
Some continuous functions related to corner polyhedra. 23-85 - Fred W. Glover:
Cut search methods in integer programming. 86-100 - Garth P. McCormick, Klaus Ritter:
Methods of conjugate directions versus quasi-Newton methods. 101-116 - Michel L. Balinski:
A note on harmonious families. 117-123 - Olvi L. Mangasarian:
Publications. 131-133 - Jean François Maurras:
Optimization of the flow through networks with gains. 135-144 - Stephen M. Robinson:
A quadratically-convergent algorithm for general nonlinear programming problems. 145-156 - Michael D. Grigoriadis, William W. White:
A partitioning algorithm for the multicommodity network flow problem. 157-177 - Jacques A. Ferland:
Maximal domains of quasi-convexity and pseudo-convexity for quadratic functions. 178-192 - Robert E. Kuenne, Richard M. Soland:
Exact and approximate solutions to the multisource weber problem. 193-209 - Richard W. Cottle:
Monotone solutions of the parametric linear complementarity problem. 210-224 - B. Curtis Eaves, Romesh Saigal:
Homotopies for computation of fixed points on unbounded regions. 225-237 - Richard W. Cottle, Arthur F. Veinott Jr.:
Polyhedral sets having a least element. 238-249 - Richard James Duffin, Elmor L. Peterson:
The proximity of (algebraic) geometric programming to linear programming. 250-253 - Jacob Ponstein:
On the maximal flow problem with real arc capacities. 254-256 - Michel L. Balinski, Andrew Russakoff:
Some properties of the assignment polytope. 257-258 - B. Mond:
Book review. 259 - Farrokh Neghabat, Robert M. Stark:
A cofferdam design optimization. 263-275 - Jean-Charles Fiorot:
Generation of all integer points for given sets of linear inequalities. 276-295 - Jacques A. Ferland:
Mathematical programming problems with quasi-convex objective functions. 296-301 - Werner Oettli:
An iterative method, having linear rate of convergence, for solving a pair of dual linear programs. 302-311 - Johan Philip:
Plane sections of simplices. 312-325 - Floyd J. Gould:
Proximate linear programming: A variable extreme point method. 326-338 - E. M. L. Beale, John A. Tomlin:
An integer programming approach to a class of combinatorial problems. 339-344 - L. C. W. Dixon:
Quasi Newton techniques generate identical points II: The proofs of four new theorems. 345-358 - Ralph E. Gomory, Ellis L. Johnson:
Some continuous functions related to corner polyhedra, II. 359-389 - Arie Tamir:
On "an efficient algorithm for minimizing barrier and penalty functions". 390-391 - David F. Shanno:
Book review. 392-394
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-25 04:46 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:
