论文信息 - On Solving Fractional (0, 1) Programs By Implicit Enumeration

On Solving Fractional (0, 1) Programs By Implicit Enumeration

AbstractIn this paper we develop an implicit enumeration method for solving Constrained (0, 1) Fractional Programming (CFP) problems. In contrast with previous methods suggested for solving (CFP) problems, our algorithm is applied on (CFP) in its original form. Further, the algorithm uses surrogate constraints, developed for (CFP) problems, in order to strengthen the binary infeasibility and fathoming tests performed on the various partial solutions.

D. Granot | F. Granot

[1] Abraham Charnes,et al. Programming with linear fractional functionals , 1962 .

[2] Ralph E. Gomory,et al. A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[3] E. Balas. An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

[4] A. M. Geoffrion. Integer Programming by Implicit Enumeration and Balas’ Method , 1967 .

[5] Egon Balas,et al. Discrete Programming by the Filter Method , 1967, Oper. Res..

[6] Arthur M. Geoffrion,et al. An Improved Implicit Enumeration Approach for Integer Programming , 1969, Oper. Res..

[7] P. Robillard. (0, 1) hyperbolic programming problems , 1971 .

[8] M. Grunspan,et al. Hyperbolic integer programming , 1973 .

[9] Y. Anzai. ON INTEGER FRACTIONAL PROGRAMMING , 1974 .

[10] H. P. Williams. Experiments in the formulation of integer programming problems , 1974 .

[11] D. Granot,et al. On Integer and Mixed Integer Fractional Programming Problems , 1977 .