Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets

Alberto Del Pia, Jeff Linderoth, Haoran Zhu. Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets. In Mohit Singh, David P. Williamson, editors, Integer Programming and Combinatorial Optimization - 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19-21, 2021, Proceedings. Volume 12707 of Lecture Notes in Computer Science, pages 193-207, Springer, 2021. [doi]

@inproceedings{PiaLZ21,
  title = {Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets},
  author = {Alberto Del Pia and Jeff Linderoth and Haoran Zhu},
  year = {2021},
  doi = {10.1007/978-3-030-73879-2_14},
  url = {https://doi.org/10.1007/978-3-030-73879-2_14},
  researchr = {https://researchr.org/publication/PiaLZ21},
  cites = {0},
  citedby = {0},
  pages = {193-207},
  booktitle = {Integer Programming and Combinatorial Optimization - 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19-21, 2021, Proceedings},
  editor = {Mohit Singh and David P. Williamson},
  volume = {12707},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-73879-2},
}