A practical approach for dealing with hard knapsack problems using general-purpose integer programming software
Year of publication: |
2025
|
---|---|
Authors: | Song, Myung Soon ; Lin, Pei Hua ; Lu, Yun ; Shively-Ertas, Emre ; Vasko, Francis J. |
Published in: |
International transactions in operational research : a journal of the International Federation of Operational Research Societies. - Oxford : Wiley-Blackwell, ISSN 1475-3995, ZDB-ID 2019815-2. - Vol. 32.2025, 3, p. 1472-1493
|
Subject: | 0-1 knapsack problem | CPLEX | general-purpose integer programming software | Gurobi | problem instance hardness | Ganzzahlige Optimierung | Integer programming | Software | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Operations Research | Operations research |
-
Multivariable branching : a 0-1 knapsack problem case study
Yang, Yu, (2021)
-
A new class of hard problem instances for the 0-1 knapsack problem
Jooken, Jorik, (2022)
-
On the design of R-based scalable frameworks for data science applications
Theußl, Stefan Peter, (2020)
- More ...
-
Dellinger, Anthony, (2023)
-
What is the best greedy-like heuristic for the weighted set covering problem?
Vasko, Francis J., (2016)
-
Lu, Yun, (2022)
- More ...