Minimal proper non-IRUP instances of the one-dimensional cutting stock problem

Vadim M. Kartak, Artem V. Ripatti, Guntram Scheithauer, Sascha Kurz

Research output: Contribution to journalArticle

22 Citations (Scopus)
Original languageEnglish
Pages (from-to)120-129
Number of pages10
JournalDiscrete Applied Mathematics
Volume187
DOIs
Publication statusPublished - 31 May 2015

Keywords

  • Cutting stock problem
  • Bin packing problem
  • Integer round-up property
  • Equivalence of instances
  • Weighted simple games
  • ROUND-UP PROPERTY
  • POWER INDEX PROBLEM

ASJC Scopus subject areas

  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

WoS ResearchAreas Categories

  • Mathematics, Applied

Fingerprint Dive into the research topics of 'Minimal proper non-IRUP instances of the one-dimensional cutting stock problem'. Together they form a unique fingerprint.

  • Projects

    Cite this