A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming.
Peiping ShenYaping DengYafei WangPublished in: J. Comput. Appl. Math. (2024)
Keyphrases
- fractional programming
- branch and bound algorithm
- branch and bound
- search tree
- lower bound
- variable ordering
- upper bound
- search algorithm
- combinatorial optimization
- np hard
- optimal solution
- column generation
- worst case
- search space
- projective geometry
- saddle point
- dynamical systems
- similarity measure
- lower and upper bounds
- computational complexity