A pseudopolynomial network flow formulation for exact knapsack separation

DOI10.1002/NET.3230220507zbMATH Open0766.90059OpenAlexW1973520467MaRDI QIDQ4014772FDOQ4014772

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

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

zbMATH Keywords

knapsack optimization

Mathematics Subject Classification ID

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

Cites Work

• Geometric algorithms and combinatorial optimization
• Title not available (Why is that?)
• Modelling with integer variables

Cited In (6)

• Knapsack polytopes: a survey
• Title not available (Why is that?)
• Separation algorithms for 0-1 knapsack polytopes
• An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
• Bidimensional packing by bilinear programming
• Arc flow formulations based on dynamic programming: theoretical foundations and applications

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)