User menu

Accès à distance ? S'identifier sur le proxy UCLouvain

Further facet generating procedures for vertex packing polytopes

Primary tabs

Wolsey, Laurence [UCL]

"Padberg and Nemhauser and Trotter have shown how certain facets of a graph can be obtained from facets of its node induced subgraphs. In a related vein Chvatal has shown cases where knowledge of the integer hull of certain substructures of the graph allows one to obtain the integer hull (complete set of facets) for the given graph. Here we examine three further facet generation procedures. The procedures are valid for general independence systems [...]"

Document type Article de périodique (Journal article)
Access type Accès restreint
Publication date 1976
Language Anglais
Journal information "Mathematical Programming" - Vol. 11, p. 158-163 (1976)
Peer reviewed yes
Publisher Springer ((Germany) Heidelberg)
issn 0025-5610
Publication status Publié
Affiliation UCL - EUEN/CORE - Center for operations research and econometrics
Links
  1. E. Balas and M.W. Padberg, “Set partitioning”, Lecture Notes for the Nato Advanced Study Institute on Combinatorial Programming, Versailles (September 1973).
  2. V. Chvatal, “On certain polytopes associated with graphs”,Journal of Combinatorial Theory B, 18 (1975) 138–154.
  3. G.L. Nemhauser and L.E. Trotter, “Properties of vertex packing and independence system polyhedra”,Mathematical Programming 6 (1974) 48–61.
  4. M.W. Padberg, “On the facial structure of set packing polyhedra”,Mathematical Programming 5 (1973) 199–215.
Bibliographic reference Wolsey, Laurence. Further facet generating procedures for vertex packing polytopes. In: Mathematical Programming, Vol. 11, p. 158-163 (1976)
Permanent URL http://hdl.handle.net/2078.1/85287