Outcome-Space Branch and Bound Algorithm for Solving Linear Multiplicative Programming.
Yuelin GaoChengxian XuYueting YangPublished in: CIS (1) (2005)
Keyphrases
- branch and bound algorithm
- finding an optimal solution
- combinatorial optimization
- integer variables
- lower bound
- branch and bound
- variable ordering
- test problems
- np hard
- upper bound
- randomly generated
- optimal solution
- lower bounding
- search tree
- search space
- randomly generated problems
- upper bounding
- mixed integer linear programming
- max sat
- precedence constraints
- weighted max sat
- lagrangian relaxation
- neural network
- traveling salesman problem
- single machine scheduling problem
- column generation
- multi objective
- strongly np hard
- search algorithm
- knn
- mathematical programming
- optimization problems