Extended Formulations for Column Constrained Orbitopes

Christopher Hojny (), Marc E. Pfetsch () and Andreas Schmitt ()
Additional contact information
Christopher Hojny: Technische Universität Darmstadt
Marc E. Pfetsch: Technische Universität Darmstadt
Andreas Schmitt: Technische Universität Darmstadt

A chapter in Operations Research Proceedings 2017, 2018, pp 197-203 from Springer

Abstract: Abstract In the literature, packing and partitioning orbitopes were discussed to handle symmetries that act on variable matrices in certain binary programs. In this paper, we extend this concept by restrictions on the number of 1-entries in each column. We develop extended formulations of the resulting polytopes and present numerical results that show their effect on the LP relaxation of a graph partitioning problem.

Keywords: Integer programming; Symmetry; Extended formulation (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-89920-6_28

Ordering information: This item can be ordered from
http://www.springer.com/9783319899206

DOI: 10.1007/978-3-319-89920-6_28

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().