Branch-and-bound method for optimizing a linear fractional function over the efficient set of MOILFP without enumerating all solutions.
(1986), An algorithm for optimizing over the we akly efficient set, Eu- ropean Journal of Operational Research 25, pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Hyperbolic Optimization over the Integer Efficient Set of MOILFP
Branch-and-bound method for optimizing a linear fractional function over the efficient set of MOILFP without enumerating all solutions.