A branch and bound algorithm for mixed zero-one multiple objective linear programming.
George MavrotasDanae DiakoulakiPublished in: Eur. J. Oper. Res. (1998)
Keyphrases
- branch and bound algorithm
- multiple objective linear programming
- lower bound
- branch and bound
- upper bound
- efficient frontier
- np hard
- lower bounding
- optimal solution
- test problems
- combinatorial optimization
- precedence constraints
- upper bounding
- randomly generated problems
- single machine scheduling problem
- data envelopment analysis
- chance constrained programming
- mixed integer linear programming
- linear program
- max sat
- lagrangian relaxation
- scheduling problem
- variable ordering
- branch and bound method
- linear programming
- finding an optimal solution
- evolutionary algorithm
- integer programming
- simulated annealing
- multi objective
- objective function
- traveling salesman problem
- search space
- multiple criteria