Oleg A. Prokopyev, Claudio N. Meneses, Carlos A.S. Oliveira and Panos M. Pardalos
Key words:
ractional 0-1 programming, hyperbolic 0-1 programming, multiple-ratio, NP-hard, local search
Mathematices Subject Classification: 90C32, 90C10, 90C60
ONLINE SUBSCRIPTION (Institutional Subscription Only)
Copyright© 2005 Yokohama Publishers
Back

Abstract:
Multiple-ratio hyperbolic (fractional) 0--1 programming problems are considered. We investigate complexity issues of these problems including local search, approximability and global verification. Some aspects of linear mixed 0--1 reformulations are also discussed. In addition, we present a GRASP-based (Greedy Randomized Adaptive Search) heuristic for solving cardinality constrained problems.
On multiple-ratio hyperbolic 0-1 programming problems

Special Issue in Honor of the 65th Birthday of Hiroshi Konno
Volume 1, Number 2, May 2005, pp. 327-345