Convergent Lagrangian and domain cut method for nonlinear knapsack problems
Year of publication: |
2009
|
---|---|
Authors: | Li, Duan ; Sun, X. L. ; Wang, J. ; McKinnon, K. I. M. |
Published in: |
Computational optimization and applications : an international journal. - Norvell, Mass. : Springer, ISSN 0926-6003, ZDB-ID 1157578-5. - Vol. 42.2009, 1, p. 67-104
|
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming |
-
Decision support system of truck routing and refueling : a dual-objective approach
Suzuki, Yoshinori, (2013)
-
Nickel, Stefan, (2022)
-
Consistency cuts for Dantzig-Wolfe reformulations
Clausen, Jens Vinther, (2022)
- More ...
-
Optimal lot solution to cardinality constrained mean-variance formulation for portfolio selction
Li, Duan, (2006)
-
A portfolio selection model using fuzzy returns
Li, Duan, (2011)
-
Improved estimation of duality gap in binary quadratic programming using a weighted distance measure
Xia, Yong, (2012)
- More ...