Exact algorithms for the two-dimensional strip packing problem with and without rotations.
Mitsutoshi KenmochiTakashi ImamichiKoji NonobeMutsunori YagiuraHiroshi NagamochiPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- exact algorithms
- approximation algorithms
- packing problem
- knapsack problem
- benchmark instances
- vehicle routing problem with time windows
- three dimensional
- np hard
- exact solution
- worst case
- benders decomposition
- combinatorial optimization
- computational problems
- heuristic methods
- combinatorial optimization problems
- combinatorial problems
- integer programming
- network design problem
- special case
- nonlinear programming
- objective function
- scheduling problem
- multi objective
- max sat
- optimal solution
- neural network