"Counting and Enumerating Optimum Cut Sets for Hypergraph ..."

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang (2024)

> Home

Details and statistics

DOI: 10.1287/MOOR.2022.0259

access: closed

type: Journal Article

metadata version: 2025-01-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mor/BeidemanCW24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mor/BeidemanCW24
Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang:
Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k. Math. Oper. Res. 49(4): 2579-2601 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.