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.
Original language | English |
---|---|
Title of host publication | Operations Research Proceedings 2017 |
Editors | Natalia Kliewer, Jan Fabian Ehmke, Ralf Borndörfer |
Place of Publication | Cham |
Publisher | Springer |
Pages | 197-203 |
Number of pages | 7 |
ISBN (Electronic) | 978-3-319-89920-6 |
ISBN (Print) | 978-3-319-89919-0 |
DOIs | |
Publication status | Published - 2017 |
Externally published | Yes |
Event | International Conference of the German Operations Research Society (GOR) - Freie Universiät Berlin, Berlin, Germany Duration: 6 Sept 2017 → 8 Sept 2017 |
Conference
Conference | International Conference of the German Operations Research Society (GOR) |
---|---|
Country/Territory | Germany |
City | Berlin |
Period | 6/09/17 → 8/09/17 |