A Branch-and-Bound Algorithm for a Class of Mixed Integer Linear Maximum Multiplicative Programs: A Bi-objective Optimization Approach.
Payman Ghasemi SaghandHadi CharkhgardChanghyun KwonPublished in: Comput. Oper. Res. (2019)
Keyphrases
- branch and bound algorithm
- lower bound
- mixed integer linear
- branch and bound
- upper bound
- optimal solution
- combinatorial optimization
- np hard
- test problems
- randomly generated problems
- lower bounding
- mathematical programming
- precedence constraints
- single machine scheduling problem
- mixed integer linear programming
- variable ordering
- branch and bound method
- max sat
- lagrangian relaxation
- search algorithm
- integer variables
- upper bounding
- neural network
- maximum clique
- finding an optimal solution
- genetic algorithm