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