Samenvatting
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.
Originele taal-2 | Engels |
---|---|
Titel | Operations Research Proceedings 2017 |
Redacteuren | Natalia Kliewer, Jan Fabian Ehmke, Ralf Borndörfer |
Plaats van productie | Cham |
Uitgeverij | Springer |
Pagina's | 197-203 |
Aantal pagina's | 7 |
ISBN van elektronische versie | 978-3-319-89920-6 |
ISBN van geprinte versie | 978-3-319-89919-0 |
DOI's | |
Status | Gepubliceerd - 2017 |
Extern gepubliceerd | Ja |
Evenement | International Conference of the German Operations Research Society (GOR) - Freie Universiät Berlin, Berlin, Duitsland Duur: 6 sep. 2017 → 8 sep. 2017 |
Congres
Congres | International Conference of the German Operations Research Society (GOR) |
---|---|
Land/Regio | Duitsland |
Stad | Berlin |
Periode | 6/09/17 → 8/09/17 |