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.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: bsu
DbLabel: Business Source Ultimate
An: 180954602
AccessLevel: 2
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Counting and Enumerating Optimum Cut Sets for Hypergraph k -Partitioning Problems for Fixed k.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Beideman%2C+Calvin%22">Beideman, Calvin</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> calvinb2@illinois.edu</i><br /><searchLink fieldCode="AR" term="%22Chandrasekaran%2C+Karthekeyan%22">Chandrasekaran, Karthekeyan</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> karthe@illinois.edu</i><br /><searchLink fieldCode="AR" term="%22Wang%2C+Weihang%22">Wang, Weihang</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> weihang3@illinois.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Mathematics+of+Operations+Research+%28INFORMS%29%22">Mathematics of Operations Research (INFORMS)</searchLink>. Nov2024, Vol. 49 Issue 4, p2579-2601. 23p.
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=bsu&AN=180954602
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1287/moor.2022.0259
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 23
        StartPage: 2579
    Titles:
      – TitleFull: Counting and Enumerating Optimum Cut Sets for Hypergraph k -Partitioning Problems for Fixed k.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Beideman, Calvin
      – PersonEntity:
          Name:
            NameFull: Chandrasekaran, Karthekeyan
      – PersonEntity:
          Name:
            NameFull: Wang, Weihang
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 11
              Text: Nov2024
              Type: published
              Y: 2024
          Identifiers:
            – Type: issn-print
              Value: 0364765X
          Numbering:
            – Type: volume
              Value: 49
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: Mathematics of Operations Research (INFORMS)
              Type: main
ResultId 1