[1] |
M. Altman, ”Bilinear programming”,Bulletin d’Academie Polonaise des Sciences 16(9) (1968) 741–746. · Zbl 0213.44902 |
[2] |
E. Balas, ”Intersection cuts–A new type of cutting planes for integer programming”,Operations Research 19 (1971) 19–39. · Zbl 0219.90035 · doi:10.1287/opre.19.1.19 |
[3] |
E. Balas, ”Intersection cuts from disjunctive constraints”, Management Science Research Report No. 330, Carnegie-Mellon University (Pittsburg, PA, February 1974). |
[4] |
E. Balas and C.A. Burdet, ”Maximizing a convex quadratic function subject to linear constraints”, Management Science Research Report No. 299, Carnegie-Mellon University (Pittsburg, PA, July 1973). |
[5] |
C.A. Burdet, ”Polaroids: A new tool in nonconvex and in integer programming”,Naval Research Logistics Quarterly 20 (1973) 13–22. · Zbl 0261.90068 · doi:10.1002/nav.3800200103 |
[6] |
C.A. Burdet, ”On polaroid intersections”, in: P. Hammer and G. Zoutendijk, eds.,Mathematical programming in theory and practice (North-Holland, Amsterdam, 1974). |
[7] |
F. Glover, ”Polyhedral convexity cuts and negative edge extensions”,Zeitschrift für Operations Research 18 (1974) 181–186. · Zbl 0288.90056 · doi:10.1007/BF02026599 |
[8] |
F. Glover, ”Polyhedral annexation in mixed integer and combinatorial programming”,Mathematical Programming 8 (1975) 161–188. · Zbl 0364.90073 · doi:10.1007/BF01681342 |
[9] |
B. Grünbaum,Convex polytopes (Interscience, New York, 1967). · Zbl 0163.16603 |
[10] |
R.G. Jeroslow, ”The principles of cutting plane theory: Part I” (with an addendum), GSIA, Carnegie-Mellon University (Pittsburg, PA, February 1974). |
[11] |
R.G. Jeroslow, ”Cutting-plane theory: Disjunctive methods”,Annals of Discrete Mathematics 1 (1977) 293–330. · Zbl 0358.90035 · doi:10.1016/S0167-5060(08)70741-6 |
[12] |
H. Konno, ”Bilinear programming, Parts I and II”, Technical Report No. 71-9 and 71-10, Dept. of Operations Research, Stanford University (Stanford, CA, 1971). |
[13] |
H. Konno, ”A cutting plane algorithm for solving bilinear programs”,Mathematical Programming 11 (1976) 14–27. · Zbl 0353.90069 · doi:10.1007/BF01580367 |
[14] |
H. Konno, ”Maximization of a convex quadratic function under linear constraints”,Mathematical Programming 11 (1976) 117–127. · Zbl 0355.90052 · doi:10.1007/BF01580380 |
[15] |
A. Majthey and A. Whinston, ”Quasi-concave minimization subject to linear constraints”,Discrete Mathematics 9 (1974) 35–59. · Zbl 0301.90037 · doi:10.1016/0012-365X(74)90070-3 |
[16] |
G. Owen, ”Cutting planes for programs with disjunctive constraints”,Optimization Theory and its Applications 11 (1973) 29–55. · Zbl 0238.90044 |
[17] |
H.D. Sherali and C.M. Shetty, ”Deep cuts in disjunctive programming”, Paper presented at the Joint National ORSA/TIMS Meeting, New Orleans, LA (May 1979). |
[18] |
C.M. Shetty and S. Selim, ”Stochastic location–allocation problems and bi-convex programming”, Presented at the ORSA/TIMS Meeting, New York, (May 1978). |
[19] |
C.M. Shetty and H.D. Sherali, ”Rectilinear distance location–allocation problem: A simplex based algorithm”,Proc. of the Internat. Symp. on Extremal Methods and Systems Analysis, Lecture Notes in Economics and Math. Systems (Springer, 1980). · Zbl 0428.90057 |
[20] |
R.M. Soland, ”Optimal facility location with concave costs”,Operations Research 22 (1974) 373–382. · Zbl 0278.90079 · doi:10.1287/opre.22.2.373 |
[21] |
H. Vaish, ”Nonconvex programming with applications to production and location problems”, Unpublished Ph.D. Dissertation, Georgia Institute of Technology (Atlanta, GA, 1974). |
[22] |
H. Vaish and C.M. Shetty, ”A cutting plane algorithm for the bilinear programming problem”,Naval Research Logistics Quarterly 24 (1977) 83–94. · Zbl 0372.90082 · doi:10.1002/nav.3800240107 |
[23] |
H. Vaish and C.M. Shetty, ”The bilinear programming problem”,Naval Research Logistics Quarterly 23 (1976) 303–309. · Zbl 0349.90071 · doi:10.1002/nav.3800230212 |
[24] |
P. Zwart, ”Nonlinear programming: counter examples to two global optimization algorithms”,Operations Research 21 (1973) 1260–1266. · Zbl 0274.90049 · doi:10.1287/opre.21.6.1260 |
[25] |
P. Zwart, ”Computational aspects of the use of cutting planes in global optimization”, in:Proceedings of the 1971 Annual Conference of the ACM (ACM, 1971) pp. 457–465. |
[26] |
P. Zwart, ”Global maximization of a convex function with linear inequality constraints”,Operations Research 22(3) (1976) 602–609. · Zbl 0322.90049 · doi:10.1287/opre.22.3.602 |