A class of web-based facets for the generalized vertex packing problem

DOI10.1016/j.dam.2004.09.008zbMath1077.68080OpenAlexW2152358568MaRDI QIDQ1763480

Hanif D. Sherali, J. Cole Smith

Publication date: 22 February 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.09.008

zbMATH Keywords

Web graphValid inequalityMixed-integer programmingGeneralized vertex packing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Facet-inducing web and antiweb inequalities for the graph coloring polytope, A branch-and-price-and-cut method for computing an optimal bramble

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A class of facet producing graphs for vertex packing polyhedra
• A polyhedral study of the generalized vertex packing problem
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• An Airspace Planning Model for Selecting Flight-plans Under Workload, Safety, and Equity Considerations