@article{GilmoreGomory1961,
  author = {Gilmore, Paul C. and Gomory, Ralph E.},
  title = {A Linear Programming Approach to the Cutting-Stock Problem},
  journal = {Operations Research},
  volume = {9}, number = {6}, pages = {849--859}, year = {1961},
  doi = {10.1287/opre.9.6.849}
}
@inproceedings{KarmarkarKarp1982,
  author = {Karmarkar, Narendra and Karp, Richard M.},
  title = {An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem},
  booktitle = {Proceedings of the 23rd Annual Symposium on Foundations of Computer Science},
  publisher = {IEEE}, pages = {312--320}, year = {1982},
  doi = {10.1109/SFCS.1982.61}
}
@inproceedings{Rothvoss2013,
  author = {Rothvo{\ss}, Thomas},
  title = {Approximating Bin Packing within {$O(\log\mathrm{OPT}\cdot\log\log\mathrm{OPT})$} Bins},
  booktitle = {Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science},
  publisher = {IEEE}, pages = {20--29}, year = {2013},
  doi = {10.1109/FOCS.2013.11}
}
@inproceedings{HobergRothvoss2017,
  author = {Hoberg, Rebecca and Rothvo{\ss}, Thomas},
  title = {A Logarithmic Additive Integrality Gap for Bin Packing},
  booktitle = {Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms},
  publisher = {SIAM}, pages = {2616--2625}, year = {2017},
  doi = {10.1137/1.9781611974782.172}
}
@article{Furedi1981,
  author = {F{\"u}redi, Zolt{\'a}n},
  title = {Maximum Degree and Fractional Matchings in Uniform Hypergraphs},
  journal = {Combinatorica}, volume = {1}, number = {2}, pages = {155--162}, year = {1981},
  doi = {10.1007/BF02579271}
}
@article{GoemansRothvoss2020,
  author = {Goemans, Michel X. and Rothvo{\ss}, Thomas},
  title = {Polynomiality for Bin Packing with a Constant Number of Item Types},
  journal = {Journal of the ACM}, volume = {67}, number = {6},
  pages = {38:1--38:21}, year = {2020}
}
@article{RietzScheithauerTerno2002,
  author = {Rietz, J{\"u}rgen and Scheithauer, Guntram and Terno, Johannes},
  title = {Families of Non-{IRUP} Instances of the One-Dimensional Cutting Stock Problem},
  journal = {Discrete Applied Mathematics}, volume = {121}, number = {1--3},
  pages = {229--245}, year = {2002}
}
@article{Caprara2015,
  author = {Caprara, Alberto and Dell'Amico, Mauro and D{\'i}az-D{\'i}az, Jos{\'e} Carlos and Iori, Manuel and Rizzi, Romeo},
  title = {Friendly Bin Packing Instances without Integer Round-up Property},
  journal = {Mathematical Programming}, volume = {150}, number = {1},
  pages = {5--17}, year = {2015}, doi = {10.1007/s10107-014-0791-z}
}
@article{EisenbrandPalvolgyiRothvoss2013,
  author = {Eisenbrand, Friedrich and P{\'a}lv{\"o}lgyi, D{\"o}m{\"o}t{\"o}r and Rothvo{\ss}, Thomas},
  title = {Bin Packing via Discrepancy of Permutations},
  journal = {ACM Transactions on Algorithms}, volume = {9}, number = {3},
  pages = {24:1--24:15}, year = {2013}, doi = {10.1145/2483699.2483704}
}
@article{Turan1941,
  author = {Tur{\'a}n, P{\'a}l},
  title = {Egy gr{\'a}felm{\'e}leti sz{\'e}ls{\H o}{\'e}rt{\'e}kfeladatr{\'o}l},
  journal = {Matematikai {\'e}s Fizikai Lapok},
  volume = {48}, pages = {436--452}, year = {1941}
}