Solving the Lexicographic Multi-Objective Mixed-Integer Linear Programming Problem using branch-and-bound and grossone methodology.
Marco CococcioniAlessandro CudazzoMassimo PappalardoYaroslav D. SergeyevPublished in: Commun. Nonlinear Sci. Numer. Simul. (2020)
Keyphrases
- branch and bound
- branch and bound algorithm
- mixed integer linear programming
- combinatorial optimization
- multi objective
- mathematical programming
- integer programming problems
- evolutionary algorithm
- column generation
- lower bound
- optimization problems
- metaheuristic
- search algorithm
- branch and bound search
- simulated annealing
- traveling salesman problem
- optimal solution
- search tree
- tree search
- particle swarm optimization
- search space
- branch and bound procedure
- cutting plane
- branch and bound method
- objective function
- upper bound
- max sat
- cost function
- genetic algorithm
- multiple objectives
- network design problem
- vehicle routing problem
- mixed integer nonlinear programming
- search strategies
- integer program
- ant colony optimization
- constraint satisfaction
- special case