A Finite Branch-and-Bound Algorithm for Linear Multiplicative Programming.
Takahito KunoPublished in: Comput. Optim. Appl. (2001)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- np hard
- upper bound
- lower bounding
- integer variables
- optimal solution
- test problems
- randomly generated problems
- single machine scheduling problem
- precedence constraints
- finding an optimal solution
- upper bounding
- search tree
- combinatorial optimization
- variable ordering
- max sat
- lagrangian relaxation
- mixed integer linear programming
- search algorithm
- scheduling problem