Nimrod Megiddo
- 1 AHO, A.V., HO~'CROFT, J.E, AND ULLMAN, J.D.The Destgn and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974. Google Scholar
- 2 BENTLEY, J.L.Multidimensional divide-and-conquer. Commun ACM 23, 4 (Apr. 1980), 214-229. Google Scholar
- 3 DANIZIG, G.B. Linear Programming and Extensions Princeton University Press, Princeton, N.J., 1963.Google Scholar
- 4 DUDA, R.O., AND HAg'F, P.E. Pattern Classtficatzon and Scene Analysis. Wiley-lnterscienc~, New York, 1973. Google Scholar
- 5 FLOYD, R.W., AND RiVEST, R.L. Expected time bounds for selection. Commun. ACM 18, 3 (Mar. 1975), 165-172. Google Scholar
- 6 GRUNBAUM, B. Convex Polytopes. Wiley, New York, 1967.Google Scholar
- 7 KHACHIAN, L.G A polynomial algorithm in linear programming. Soviet Math. Dokl. 20 (1979), 191-194.Google Scholar
- 8 KLEE, V., AND MINTY, G.J.How good is the simplex algorithm? In Inequalities, vol. 3. Academic Press, New York, 1972, pp. 159-175.Google Scholar
- 9 KNUTH, D.E. MathemaUcal analysis of algorithms. In lnformatton Processing 71. Elsevier North- Holland, New York, 1972, pp. 19-27.Google Scholar
- 10 MEGIDDO, N.Is binary encoding appropriate for the problem-language relationship? Theor. Comput. So 19 (1982), 337-341.Google Scholar
- 11 MEGIDDO, N.Solving linear programming when the dimension is fixed. Dept. of Statistics, Tel Avlv Univemty, April 1982.Google Scholar
- 12 MEGIDDO, N.Linear.time algonthms for linear programming in Rz and related problems. SIAM J Comput 12, 4 (Nov. 1983).Google Scholar
- 13 MEGIDDO, N.Towards a genuinely polynomial algorithm for linear programming. SlAM J. Comput. 12, 2 (May 1983), 347-353.Google Scholar
- 14 MEISEL, W.S. Computer-Oriented Approaches to Pattern Recognition. Academic Press, New York, 1972.Google Scholar
- 15 MONIER, L.Combinatorial solutions of multidtmensional divide-and-conquer reeurre, nces. Z Algorithms 1 (I980), 60-74.Google Scholar
- 16 RICE, J.The Apprommatlon of Functions. Vol. 1; The Linear Theory. Addison-Wesley, Reading, Mass., 1964.Google Scholar
- 17 SCHONHAGE, A., PATERSON, M., AND PIPPENOER, N.Finding the median. J. Compm. Syst. SeL 13 (1976), 184-199.Google Scholar
- 18 SHAMOS, M.I.Computational geometry. Ph.D. dissertation, Dept. of Computer Science, Yale Univ., New Haven, Conn., 1978. Google Scholar
- 19 SMALE, $. On the average speed of the simplex method of hnear programming. To appear in Math ProgramGoogle Scholar
Index Terms
- Linear Programming in Linear Time When the Dimension Is Fixed
Recommendations
Safe bounds in linear and mixed-integer linear programming
Current mixed-integer linear programming solvers are based on linear programming routines that use floating-point arithmetic. Occasionally, this leads to wrong solutions, even for problems where all coefficients and all solution components are small ...
On linear programming relaxations for solving polynomial programming problems
Highlights- Theoretically compared the tightness of the J-set relaxation with the recursive McCormick relaxations.
AbstractThis paper studies linear programming (LP) relaxations for solving polynomial programming problems. A polynomial programming problem can be equivalently formulated as a quadratically constrained quadratic program (QCQP) by introducing ...
Solving Bilevel Linear Programs Using Multiple Objective Linear Programming
We present an algorithm for solving bilevel linear programs that uses simplex pivots on an expanded tableau. The algorithm uses the relationship between multiple objective linear programs and bilevel linear programs along with results for minimizing a ...
Comments