Counting and enumerating optimum cut sets for hypergraph k-partitioning problems for fixed k
Year of publication: |
2024
|
---|---|
Authors: | Beideman, Calvin ; Chandrasekaran, Karthekeyan ; Wang, Weihang |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 49.2024, 4, p. 2579-2601
|
Subject: | algorithms | enumeration | hypergraphs | k-partition problems | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
Hypergraph k-Cut for fixed k in deterministic polynomial time
Chandrasekaran, Karthekeyan, (2022)
-
Consistency cuts for Dantzig-Wolfe reformulations
Clausen, Jens Vinther, (2022)
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
- More ...
-
The cutting plane method is polynomial for perfect matchings
Chandrasekaran, Karthekeyan, (2016)
-
Hypergraph k-Cut for fixed k in deterministic polynomial time
Chandrasekaran, Karthekeyan, (2022)
-
Reconstruction of Rural Mutual Assistance Funding Cooperatives
Cao, Ruhua, (2010)
- More ...