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. M. |
Published in: |
Journal of global optimization : an international journal dealing with theoretical and computational aspects of seeking global optima and their applications in science, management and engineering. - Dordrecht [u.a.] : Springer, ISSN 0925-5001, ZDB-ID 1074566x. - Vol. 50.2011, 4, p. 657-674
|
Saved in:
Saved in favorites
Similar items by person
-
Max-k-cut by the discrete dynamic convexized method
Zhu, Wenxing, (2013)
-
Max-k-Cut by the Discrete Dynamic Convexized Method
Zhu, Wenxing, (2013)
-
A dynamic convexized method for nonconvex mixed integer nonlinear programming
Zhu, Wenxing, (2011)
- More ...