View in EDS HTML Full Text PDF Full Text

Counting and Enumerating Optimum Cut Sets for Hypergraph k -Partitioning Problems for Fixed k.

Saved in:
Bibliographic Details
Title: Counting and Enumerating Optimum Cut Sets for Hypergraph k -Partitioning Problems for Fixed k.
Authors: Beideman, Calvin1 (AUTHOR) calvinb2@illinois.edu, Chandrasekaran, Karthekeyan1 (AUTHOR) karthe@illinois.edu, Wang, Weihang1 (AUTHOR) weihang3@illinois.edu
Source: Mathematics of Operations Research (INFORMS). Nov2024, Vol. 49 Issue 4, p2579-2601. 23p.
Database: Business Source Ultimate
Full text is not displayed to guests.
Description
ISSN:0364765X
DOI:10.1287/moor.2022.0259