Solving the generalized knapsack problem with variable coefficients

DOI10.1002/(SICI)1520-6750(199608)43:5%3C673::AID-NAV5%3E3.0.CO;2-2MaRDI QIDQ5687641zbMATH OpenOpenAlexFDO

Authors Kaj Holmberg, Kurt Jörnsten

Publication date 16 December 1996

Full work available at URL https://doi.org/10.1002/(sici)1520-6750(199608)43:5%3C673::aid-nav5%3E3.0.co;2-2

zbMATH Keywords

decompositionsubgradient optimizationduality gapLagrangian dualityinterval bisectiongeneralized knapsackmean-value cross-decompositionoptimal generating unit commitment problem

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 4093178
• Publication:4204000
• Exact methods for the knapsack problem and its generalizations
• Improved Lagrangean decomposition: An application to the generalized assignment problem
• scientific article; zbMATH DE number 4139486

Cited in

(2)

• Variable fixing algorithms for the continuous quadratic Knapsack problem
• Mean value cross decomposition for nonlinear convex problems

This page was built for publication: Solving the generalized knapsack problem with variable coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5687641)