An exact algorithm for the 0–1 linear knapsack problem with a single continuous variable
Year of publication: |
2011
|
---|---|
Authors: | Lin, Geng ; Zhu, Wenxing ; Ali, M. |
Published in: |
Journal of Global Optimization. - Springer. - Vol. 50.2011, 4, p. 657-673
|
Publisher: |
Springer |
Subject: | Knapsack problem | Mixed integer programming | Branch and bound |
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
Heuristic and exact algorithms for the interval min-max regret knapsack problem
Furini, Fabio, (2015)
-
Cover by disjoint cliques cuts for the knapsack problem with conflicting items
Luiz, Thiago Alcântara, (2021)
- More ...
-
A discrete dynamic convexized method for the max-cut problem
Lin, Geng, (2012)
-
Max-k-Cut by the Discrete Dynamic Convexized Method
Zhu, Wenxing, (2013)
-
An exact algorithm for the 0–1 linear knapsack problem with a single continuous variable
Lin, Geng, (2011)
- More ...