Simplex pivots on the set packing polytope

DOI10.1007/BF01582240zbMath0578.90056MaRDI QIDQ3701197

Nemhauser, George I., Yoshiro Ikura

Publication date: 1985

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

set packingintegral extreme pointsimplex pivots

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

On a family of \(0/1\)-polytopes with an NP-complete criterion for vertex nonadjacency relation ⋮ A characterization of the uncapacitated network design polytope ⋮ A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem ⋮ Adjacency on combinatorial polyhedra

Cites Work

• Unnamed Item
• Unnamed Item
• On certain polytopes associated with graphs
• An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs
• On the Set-Covering Problem

This page was built for publication: Simplex pivots on the set packing polytope