On complexity of unconstrained hyperbolic 0-1 programming problems

Operations Research Letters

Volumn 33, Issue 3, 2005, Pages 312-318

  Prokopyev, Oleg A ^a   Huang, Hong Xuan ^b   Pardalos, Panos M ^a  

^a UNIVERSITY OF FLORIDA   (United States)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Approximability; Complexity; Hyperbolic 0 1 programming; Local search; Uniqueness

Indexed keywords

APPROXIMATION THEORY; FUNCTIONS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

APPROXIMABILITY; COMPLEXITY; HYPERBOLIC 0-1 PROGRAMMING; LOCAL SEARCH; UNIQUENESS;

MATHEMATICAL PROGRAMMING;

EID: 10044238760     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.05.011     Document Type: Article

References (18)

1. S. Arora, C. Lund, Hardness of approximations, in: D. Hochbaum (Ed.), Approximation Algorithms for NP-hard Problems, PWS Publishing, Boston, 1996, pp. 399-446.
2. S.R. Arora, K. Swamp, M.C. Puri, The set covering problem with linear fractional functional, Indian J. Pure Appl. Math. 8 (1977) 578-588.
3. M. Bellare, P. Rogaway, The complexity of approximating a nonlinear program, in: P.M. Pardalos (Ed.), Complexity of Numerical Optimization, World Scientific, Singapore, 1993, pp. 16-32.
4. E. Boros, P. Hammer, Pseudo-Boolean optimization, Discrete Appl. Math. 123 (1-3) (2002) 155-225.
5. A. Charnes, W.W. Cooper, Programming with linear fractional functionals, Naval Res. Logist. Quart. 9 (1962) 181-186.
6. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1979.
7. P.L. Hammer, S. Rudeanu, Boolean Methods in Operations Research and Related Areas, Springer, Berlin, Heidelberg, New York, 1968.
8. P. Hansen, M. Poggi de Aragão, C.C. Ribeiro, Boolean query optimization and the 0-1 hyperbolic sum problem, Ann. Math. Artif. Intell. 1 (1990) 97-109.
9. P. Hansen, M. Poggi de Aragão, C.C. Ribeiro, Hyperbolic 0-1 programming and query optimization in information retrieval, Math. Programming 52 (1991) 256-263.
10. D.S. Johnson, C.H. Papadimitriou, M. Yannakakis, How easy is local search?, J. Comput. System Sci. 37/1 (1988) 79-1000.
11. H. Li, A global approach for general 0-1 fractional programming, European J. Oper. Res. 73 (1994) 590-596.
12. C.H. Papadimitriou, On the complexity of unique solution, in: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982, pp. 14-20.
13. P.M. Pardalos, S. Jha, Complexity of uniqueness and local search in quadratic 0-1 programming, Oper. Res. Lett. 11 (1992) 119-123.
14. S. Saipe, Solving a (0,1) hyperbolic program by branch and bound, Naval Res. Logist. Quart. 22 (1975) 497-515.
15. A.A. Schaffer, M. Yannakakis, Simple local search problems that are hard to solve, SIAM J. Comput. 20 (1) (1991) 56-87.
16. M. Tawarmalani, S. Ahmed, N. Sahinidis, Global optimization of 0-1 hyperbolic programs, J. Global Optim. 24 (2002) 385-416.
17. L.G. Valiant, V.V. Vazirani, NP is as easy as detecting unique solutions, Theoret. Comput. Sci. 47 (1986) 85-93.
18. T.-H. Wu, A note on a global approach for general 0-1 fractional programming, European J. Oper. Res. 101 (1997) 220-223.