A branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problems.
Minghe SunPublished in: Networks (2013)
Keyphrases
- multi objective optimization
- bi objective
- multiple objectives
- set covering problem
- efficient solutions
- multi objective
- branch and bound algorithm
- optimal solution
- pareto optimal
- decision variables
- integer variables
- genetic algorithm
- randomly generated problems
- lower bound
- test problems
- upper bound
- branch and bound
- combinatorial optimization
- heuristic methods
- np hard
- network design problem
- optimization algorithm
- mixed integer linear programming
- np complete
- lagrangian relaxation
- mixed integer programming
- branch and bound method
- single machine scheduling problem
- precedence constraints
- genetic programming
- combinatorial optimization problems
- knapsack problem