default search action
Mathematical Programming, Volume 8
Volume 8, Number 1, 1975
- Gabor T. Herman:
A relaxation method for reconstructing objects from noisy X-rays. 1-19 - Lee J. White, Mark Lee Gillenson:
An efficient algorithm for minimumk-covers in weighted graphs. 20-42 - Franz J. M. Salzborn:
Break minimization. 43-53 - A. L. Brearley, Gautam Mitra, H. Paul Williams:
Analysis of mathematical programming problems prior to applying the simplex algorithm. 54-83 - Fred W. Glover:
New results on equivalent integer programming formulations. 84-90 - G. Terry Ross, Richard M. Soland:
A branch and bound algorithm for the generalized assignment problem. 91-103 - H. R. Howson, N. G. F. Sancho:
A new algorithm for the solution of multi-state dynamic programming problems. 104-116 - David A. Pyne:
On interior and convexity conditions, development of dual problems and saddlepoint optimality criteria in abstract mathematical programming. 125-133 - Jack Elzinga, Thomas G. Moore:
A central cutting plane algorithm for the convex programming problem. 134-145 - Egon Balas:
Facets of the knapsack polytope. 146-164 - Laurence A. Wolsey:
Faces for a linear inequality in 0-1 variables. 165-178 - Peter L. Hammer, Ellis L. Johnson, Uri N. Peled:
Facet of regular 0-1 polytopes. 179-206 - A. Buckley:
An alternate implementation of Goldfarb's minimization algorithm. 207-231 - George L. Nemhauser, Leslie E. Trotter Jr.:
Vertex packings: Structural properties and algorithms. 232-248 - Robert Mifflin:
Convergence bounds for nonlinear programming algorithms. 251-271 - Didier Fayard, Gérard Plateau:
Resolution of the 0-1 knapsack problem: Comparison of methods. 272-307 - P. Huard:
Optimization algorithms and point-to-set-maps. 308-331 - R. Lehmann, Werner Oettli:
The theorem of the alternative, the key-theorem, and the vector-maximum problem. 332-344 - David E. Bell, Marshall L. Fisher:
Improved integer programming bounds using intersections of corner polyhedra. 345-368 - Joachim H. Ahrens, Gerd Finke:
Degeneracy in fixed cost transportation problems. 369-374 - Joseph G. Ecker
, Issoufou Kouada:
Finding efficient points for linear multiple objective programs. 375-377 - Martin Grötschel, Manfred W. Padberg:
Partial linear characterizations of the asymmetric travelling salesman polytope. 378-381 - M. Sakarovitch:
Quasi-balanced matrices. 382-386
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-12-16 22: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: