A branch-and-bound algorithm for maximizing the sum of several linear ratios.
Takahito KunoPublished in: J. Glob. Optim. (2002)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- combinatorial optimization
- precedence constraints
- test problems
- lower bounding
- optimal solution
- randomly generated problems
- np hard
- lagrangian relaxation
- search tree
- mixed integer linear programming
- single machine scheduling problem
- integer variables
- linear functions
- upper bounding
- finding an optimal solution
- search algorithm
- branch and bound method
- column generation
- maximum clique
- objective function
- tabu search
- network design problem
- metaheuristic
- cost function
- multi objective
- search space
- bayesian networks