Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case.
Thomas VincentFlorian SeippStefan RuzikaAnthony PrzybylskiXavier GandibleuxPublished in: Comput. Oper. Res. (2013)
Keyphrases
- branch and bound
- bi objective
- multiple objectives
- linear programming
- optimal solution
- multi objective
- efficient solutions
- column generation
- knapsack problem
- lower bound
- branch and bound algorithm
- linear programming problems
- search algorithm
- search space
- set covering problem
- multi objective optimization
- objective function
- combinatorial optimization
- minimum cost flow
- linear program
- upper bound
- np hard
- nsga ii
- tree search
- shortest path problem
- ant colony optimization
- search strategies
- feasible solution
- dynamic programming
- evolutionary algorithm
- fitness function
- genetic algorithm
- branch and bound procedure
- network design
- optimization algorithm
- metaheuristic
- lower and upper bounds
- max sat
- combinatorial optimization problems
- integer programming
- differential evolution
- genetic programming
- reinforcement learning