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 journalArticleResearchpeer-review

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

Fingerprint

Cutting Stock Problem
Inductive logic programming (ILP)
Equivalence classes
Bins
Linear programming
Integer
LP Relaxation
Simple Game
Bin Packing Problem
Integer Linear Programming
Equivalence class
Enumeration
Decompose
Formulation

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

Cite this

Kartak, Vadim M. ; Ripatti, Artem V. ; Scheithauer, Guntram ; Kurz, Sascha. / Minimal proper non-IRUP instances of the one-dimensional cutting stock problem. In: Discrete Applied Mathematics. 2015 ; Vol. 187. pp. 120-129.
@article{f3b0ac6f91264ff2884a427d32025983,
title = "Minimal proper non-IRUP instances of the one-dimensional cutting stock problem",
keywords = "Cutting stock problem, Bin packing problem, Integer round-up property, Equivalence of instances, Weighted simple games, ROUND-UP PROPERTY, POWER INDEX PROBLEM",
author = "Kartak, {Vadim M.} and Ripatti, {Artem V.} and Guntram Scheithauer and Sascha Kurz",
year = "2015",
month = "5",
day = "31",
doi = "10.1016/j.dam.2015.02.020",
language = "English",
volume = "187",
pages = "120--129",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",

}

Minimal proper non-IRUP instances of the one-dimensional cutting stock problem. / Kartak, Vadim M.; Ripatti, Artem V.; Scheithauer, Guntram; Kurz, Sascha.

In: Discrete Applied Mathematics, Vol. 187, 31.05.2015, p. 120-129.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

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

AU - Kartak, Vadim M.

AU - Ripatti, Artem V.

AU - Scheithauer, Guntram

AU - Kurz, Sascha

PY - 2015/5/31

Y1 - 2015/5/31

KW - Cutting stock problem

KW - Bin packing problem

KW - Integer round-up property

KW - Equivalence of instances

KW - Weighted simple games

KW - ROUND-UP PROPERTY

KW - POWER INDEX PROBLEM

UR - http://www.scopus.com/inward/record.url?scp=84928215485&partnerID=8YFLogxK

UR - https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=tsmetrics&SrcApp=tsm_test&DestApp=WOS_CPL&DestLinkType=FullRecord&KeyUT=000353846000013

U2 - 10.1016/j.dam.2015.02.020

DO - 10.1016/j.dam.2015.02.020

M3 - Article

VL - 187

SP - 120

EP - 129

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

ER -