A pseudopolynomial network flow formulation for exact knapsack separation

DOI10.1002/NET.3230220507MaRDI QIDQ4014772zbMATH OpenOpenAlexFDO

Authors E. Andrew Boyd

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

zbMATH Keywords

knapsack optimization

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Deterministic network models in operations research (90B10) Linear programming (90C05) Integer programming (90C10)

Recommendations

• Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
• scientific article; zbMATH DE number 710573
• On the complexity of separation from the knapsack polytope
• A cutting plane method for knapsack polytope
• Separation algorithms for 0-1 knapsack polytopes

Cites work

• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Modelling with integer variables

Cited in

(8)

• Bidimensional packing by bilinear programming
• Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
• An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
• Arc flow formulations based on dynamic programming: theoretical foundations and applications
• Separation algorithms for 0-1 knapsack polytopes
• scientific article; zbMATH DE number 4112385 (Why is no real title available?)
• Computational aspects of lifted cover inequalities for knapsacks with few different weights
• Knapsack polytopes: a survey

This page was built for publication: A pseudopolynomial network flow formulation for exact knapsack separation

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