ε-Approximation minimization of convex functions in fixed dimension

Operations Research Letters

Volumn 18, Issue 4, 1996, Pages 171-176

  Kabadi, S N ^a   Aneja, Y P ^b  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

^b UNIVERSITY OF WINDSOR   (Canada)

Author keywords

Combinatorial algorithm; Fixed dimension; Parametric search; Strongly polynomial algorithm; Approximation

Indexed keywords

EID: 0007159130     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6377(95)00028-3     Document Type: Article

References (16)

1. Y.P. Aneja and S.N. Kabadi, "Polynomial algorithms for lagrangean relaxations in combinatorial problems", Working Paper Series No. W91-03, ISSN No. 0714-6191, Faculty of Business, University of Windsor, 1991.
2. Y.P. Aneja and S.N. Kabadi, "Lagrangean relaxation of certain constrained NP-hard combinatorial problem", submitted for publication.
3. Y.P. Aneja and S.N. Kabadi, "Equivalence of ε-approximate separation and optimization in fixed dimensions", under preparation.
4. Y.P. Aneja and K.P.K. Nair, "Bicriteria transportation problem", Manage. Sci. 25, 73-78 (1979).
5. E. Cohen and N. Megiddo, "Maximizing concave functions in fixed dimensions", in: P.M. Pardalos, (ed.), Complexity in Numerical Optimization, World Scientific, Singapore, 1993, pp. 74-87.
6. M.E. Dyer, "Linear time algorithms for two- and three-variable linear programs, SIAM J. Comput. 13, 31-45 (1984).
7. M. Grotschel, L. Lovasz and A. Schrijver, "The ellipsoid method and its consequences in combinatorial optimization", Combinatorics 1, 169-197 (1981).
8. N. Megiddo, "Combinatorial optimization with rational objective functions", Math. Oper. Res. 4, 412-424 (1979).
9. 3 and related problems", SIAM J. Comput. 12, 4 (1983).
10. N. Megiddo, "Linear programming in linear time when the dimension is fixed", J. Assoc. Comput. Mach. 31, 114-127 (1984).
11. K.G. Murty, Linear Programming, Wiley, New York, 1983.
12. G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
13. C.H. Norton, S. Plotkin and E. Tardos, "Using separation algorithms in fixed dimensions", in: Proc. Ist Ann. ACM-SIAM Symp. on Discrete Algorithms, 1990, pp. 377-387.
14. T. Radzik, "Newton's method for fractional combinatorial optimization", in Proc. 33rd IEEE Ann. Symp. on Foundations of Computer Science, 1992, pp. 659-669.
15. A. Schrijver, Theory of Linear and Integer Programming, Wiley, New York, 1986.
16. S. Toledo, "Approximate parametric searching", Inform. Process. Lett. 47, 1-4 (1993).