File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: On the mixed set covering, packing and partitioning polytope

TitleOn the mixed set covering, packing and partitioning polytope
Authors
KeywordsSet partitioning
Odd hole
Polyhedral structure
Set covering
Set packing
Facet-defining inequalities
Issue Date2016
Citation
Discrete Optimization, 2016, v. 22, p. 162-182 How to Cite?
Abstract© 2016 Elsevier B.V. We study the polyhedral structure of the mixed set covering, packing and partitioning problem, which has drawn little attention in the literature but has many real-life applications. By considering the “interactions” between the different types of edges of an induced graph, we develop new classes of valid inequalities. In particular, we derive the (generalized) mixed odd hole inequalities, and identify sufficient conditions for them to be facet-defining. In the special case when the induced graph is a mixed odd hole, the inclusion of this new facet-defining inequality provide a complete polyhedral characterization of the mixed odd hole polytope. Computational experiments indicate that these new valid inequalities may be effective in reducing the computation time in solving mixed covering and packing problems.
Persistent Identifierhttp://hdl.handle.net/10722/246773
ISSN
2015 Impact Factor: 0.889
2015 SCImago Journal Rankings: 0.924

 

DC FieldValueLanguage
dc.contributor.authorKuo, Yong Hong-
dc.contributor.authorLeung, Janny M.Y.-
dc.date.accessioned2017-09-26T04:27:56Z-
dc.date.available2017-09-26T04:27:56Z-
dc.date.issued2016-
dc.identifier.citationDiscrete Optimization, 2016, v. 22, p. 162-182-
dc.identifier.issn1572-5286-
dc.identifier.urihttp://hdl.handle.net/10722/246773-
dc.description.abstract© 2016 Elsevier B.V. We study the polyhedral structure of the mixed set covering, packing and partitioning problem, which has drawn little attention in the literature but has many real-life applications. By considering the “interactions” between the different types of edges of an induced graph, we develop new classes of valid inequalities. In particular, we derive the (generalized) mixed odd hole inequalities, and identify sufficient conditions for them to be facet-defining. In the special case when the induced graph is a mixed odd hole, the inclusion of this new facet-defining inequality provide a complete polyhedral characterization of the mixed odd hole polytope. Computational experiments indicate that these new valid inequalities may be effective in reducing the computation time in solving mixed covering and packing problems.-
dc.languageeng-
dc.relation.ispartofDiscrete Optimization-
dc.subjectSet partitioning-
dc.subjectOdd hole-
dc.subjectPolyhedral structure-
dc.subjectSet covering-
dc.subjectSet packing-
dc.subjectFacet-defining inequalities-
dc.titleOn the mixed set covering, packing and partitioning polytope-
dc.typeArticle-
dc.description.natureLink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.disopt.2016.05.004-
dc.identifier.scopuseid_2-s2.0-84991218747-
dc.identifier.volume22-
dc.identifier.spage162-
dc.identifier.epage182-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats