The total matching polytope generalizes the stable set polytope and the matching polytope. In this paper, we first propose new facet-defining inequalities for the total matching polytope. We then give an exponential-sized, non-redundant description in the original space and a compact description in an extended space of the total matching polytope of complete bipartite graphs.
Faenza, Y., Ferrarini, L. (2024). The total matching polytope of complete bipartite graphs. OPERATIONS RESEARCH LETTERS, 56(September 2024) [10.1016/j.orl.2024.107144].
The total matching polytope of complete bipartite graphs
Ferrarini L.
2024
Abstract
The total matching polytope generalizes the stable set polytope and the matching polytope. In this paper, we first propose new facet-defining inequalities for the total matching polytope. We then give an exponential-sized, non-redundant description in the original space and a compact description in an extended space of the total matching polytope of complete bipartite graphs.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Faenza-Ferrarini-2024-Operations Research Letters-VoR.pdf
Solo gestori archivio
Tipologia di allegato:
Publisher’s Version (Version of Record, VoR)
Licenza:
Tutti i diritti riservati
Dimensione
343.59 kB
Formato
Adobe PDF
|
343.59 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
