The total matching polytope of complete bipartite graphs
Year of publication: |
2024
|
---|---|
Authors: | Faenza, Yuri ; Ferrarini, Luca |
Published in: |
Operations research letters : a journal of INFORMS devoted to the rapid publication of concise contributions in operations research. - Amsterdam [u.a.] : Elsevier Science, ISSN 0167-6377, ZDB-ID 1467065-3. - Vol. 56.2024, Art.-No. 107144, p. 1-8
|
Subject: | Combinatorial optimization | Complete bipartite graphs | Extended formulations | Integer programming | Polyhedral combinatorics | Total matching | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Matching |
-
Integer programming models and polyhedral study for the geodesic classification problem on graphs
Araújo, Paulo H. M., (2024)
-
Total coloring and total matching : polyhedra and facets
Ferrarini, Luca, (2022)
-
The unimodular intersection problem
Kaibel, Volker, (2015)
- More ...
-
Total coloring and total matching : polyhedra and facets
Ferrarini, Luca, (2022)
-
Understanding popular matchings via stable matchings
Cseh, Ágnes, (2020)
-
Extended Formulations for Packing and Partitioning Orbitopes
Faenza, Yuri, (2009)
- More ...