Bin packing and cutting stock problems: Mathematical models and exact algorithms.
Maxence DelormeManuel IoriSilvano MartelloPublished in: Eur. J. Oper. Res. (2016)
Keyphrases
- mathematical models
- exact algorithms
- bin packing
- cutting stock problems
- knapsack problem
- multiple objectives
- graph colouring
- mathematical model
- approximation algorithms
- heuristic methods
- hyper heuristics
- combinatorial problems
- experimental data
- exact solution
- complex systems
- max sat
- tabu search
- search tree
- combinatorial optimization
- combinatorial optimization problems
- artificial intelligence
- packing problem
- np hard
- constraint satisfaction problems
- multi objective
- dynamic programming
- optimal solution
- computational models
- greedy algorithm
- evolutionary algorithm
- fitness function
- computational model
- linear programming