Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets-Reference-Cited by-同舟云学术

Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets

Published:2021 Issue: Volume: Page:193-207
ISSN:0302-9743
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Del Pia Alberto^ORCID,Linderoth Jeff^ORCID,Zhu Haoran^ORCID

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-73879-2_14

Reference15 articles.

1. Balas, E.: Facets of the knapsack polytope. Math. Program. 8(1), 146–164 (1975)

2. Bodur, M., Del Pia, A., Dey, S., Molinaro, M., Pokutta, S.: Aggregation-based cutting-planes for packing and covering integer programs. Math. Program. 171, 331–359 (2018)

3. Calafiore, G., Campi, M.: The scenario approach to robust control design. IEEE Trans. Autom. Control 51, 742–753 (2006)

4. Crowder, H., Johnson, E.L., Padberg, M.: Solving large-scale zero-one linear programming problems. Oper. Res. 31(5), 803–834 (1983)

5. Del Pia, A., Linderoth, J., Zhu, H.: Multi-cover inequalities for totally-ordered multiple knapsack sets. Optimization Online (2020). http://www.optimization-online.org/DB_HTML/2020/11/8107.html

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. New classes of Facets for complementarity knapsack problems;Discrete Applied Mathematics;2024-10

2. On the complexity of separating cutting planes for the knapsack polytope;Mathematical Programming;2023-05-04

3. On the Complexity of Separation from the Knapsack Polytope;Integer Programming and Combinatorial Optimization;2022

4. New Classes of Facets for Complementarity Knapsack Problems;Lecture Notes in Computer Science;2022