Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems

Keyphrases

• Bin Packing 100%
• Pseudo-polynomial 100%
• Polynomial Formulation 100%
• Cutting Stock Problem 100%
• Bin Packing Problem 66%
• Adaptation 33%
• Classical Model 33%
• Dominance Relation 33%
• Benchmark Instances 33%
• Computational Testing 33%
• Pattern-based 33%
• Column Generation 33%
• Lower Bound Techniques 33%
• Dual Information 33%
• Item Fragmentation 33%
• Equivalence Relation 33%
• Variable-sized Bin Packing 33%

Computer Science

• Bin Packing Problem 100%
• Column Generation 50%
• Equivalence Relation 50%
• Benchmark Instance 50%