An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound.
Maria João AlvesJoão C. N. ClímacoPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- mixed integer programming
- branch and bound
- reference point
- column generation
- multi objective
- branch and bound method
- lower bound
- branch and bound algorithm
- network design problem
- search algorithm
- search space
- optimal solution
- linear programming relaxation
- evolutionary algorithm
- upper bound
- lagrangian relaxation
- combinatorial optimization
- objective function
- mixed integer
- cutting plane
- valid inequalities
- production planning
- particle swarm optimization
- lot sizing
- multiple objectives
- convex hull
- genetic algorithm
- region of interest
- linear program
- traveling salesman problem
- linear programming