Solving the generalized knapsack problem with variable coefficients

DOI<673::AID-NAV5>3.0.CO;2-2 10.1002/(SICI)1520-6750(199608)43:5<673::AID-NAV5>3.0.CO;2-2zbMath0868.90085OpenAlexW2110056918MaRDI QIDQ5687641

Kaj Holmberg, Kurt O. Jørnsten

Publication date: 16 December 1996

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199608)43:5<673::aid-nav5>3.0.co;2-2

zbMATH Keywords

decompositionduality gapsubgradient optimizationLagrangian dualityinterval bisectiongeneralized knapsackmean-value cross-decompositionoptimal generating unit commitment problem

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (1)

Mean value cross decomposition for nonlinear convex problems

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