A pseudopolynomial network flow formulation for exact knapsack separation
From MaRDI portal
Publication:4014772
DOI10.1002/net.3230220507zbMath0766.90059OpenAlexW1973520467MaRDI QIDQ4014772
Publication date: 13 October 1992
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230220507
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Linear programming (90C05) Deterministic network models in operations research (90B10)
Related Items
Knapsack polytopes: a survey, Separation algorithms for 0-1 knapsack polytopes, Arc flow formulations based on dynamic programming: theoretical foundations and applications, Bidimensional packing by bilinear programming
Cites Work