Minimal proper non-IRUP instances of the one-dimensional Cutting Stock Problem

Research output: Contribution to journalResearch articleContributedpeer-review

Contributors

Details

Original languageEnglish
Pages (from-to)120-129
Number of pages10
JournalDiscrete Applied Mathematics
Volume187
Publication statusPublished - 2015
Peer-reviewedYes

External IDs

Scopus 84928215485

Keywords

DFG Classification of Subject Areas according to Review Boards

Subject groups, research areas, subject areas according to Destatis

Keywords

  • Cutting stock problem, bin packing problem, integer round-up property, equivalence of instances, weighted simple games