A comparative study of exact methods for the bi-objective integer one-dimensional cutting stock problem.
Angelo Aliano FilhoAntônio Carlos MorettiMargarida Vaz PatoPublished in: J. Oper. Res. Soc. (2018)
Keyphrases
- bi objective
- minimum cost flow
- exact methods
- efficient solutions
- heuristic methods
- optimal solution
- multi objective
- np hard
- exact algorithms
- integer programming
- lower bound
- knapsack problem
- branch and bound algorithm
- multi objective optimization
- network design
- multiple objectives
- ant colony optimization
- search methods
- shortest path problem
- exact solution
- nsga ii
- tabu search
- optimization algorithm
- simulated annealing
- bayesian networks
- genetic algorithm
- objective function
- dynamic programming
- probability distribution
- scheduling problem
- upper bound
- routing problem
- linear programming
- test problems
- branch and bound