Zobrazit v EDS

A class of special combinatorial optimization problems and their algorithms

Uloženo v:
Podrobná bibliografie
Název: A class of special combinatorial optimization problems and their algorithms
Autoři: Luo, Zongjun
Informace o vydavateli: Editorial Board of Mathematica Applicata, Huazhong University of Science and Technology, Wuhan
Témata: Combinatorial optimization, dynamic programming algorithm, polynomial algorithm, Programming involving graphs or networks, quasi-polynomial algorithm
Popis: Summary: The author presents three new models of combinatorial optimization problems. Especially, a polynomial algorithm and a quasi-polynomial algorithm are given, their complexities are \(O(N^2)\) and \(O(N^2a)\), respectively.
Druh dokumentu: Article
Popis souboru: application/xml
Přístupová URL adresa: https://zbmath.org/1382333
Přístupové číslo: edsair.c2b0b933574d..bf50db6e2bcbe0cb93bc1fea499b1333
Databáze: OpenAIRE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://explore.openaire.eu/search/publication?articleId=c2b0b933574d%3A%3Abf50db6e2bcbe0cb93bc1fea499b1333
    Name: EDS - OpenAIRE (s4221598)
    Category: fullText
    Text: View record at OpenAIRE
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Luo%20Z
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edsair
DbLabel: OpenAIRE
An: edsair.c2b0b933574d..bf50db6e2bcbe0cb93bc1fea499b1333
RelevancyScore: 685
AccessLevel: 3
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 685
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A class of special combinatorial optimization problems and their algorithms
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Luo%2C+Zongjun%22">Luo, Zongjun</searchLink>
– Name: Publisher
  Label: Publisher Information
  Group: PubInfo
  Data: Editorial Board of Mathematica Applicata, Huazhong University of Science and Technology, Wuhan
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Combinatorial+optimization%22">Combinatorial optimization</searchLink><br /><searchLink fieldCode="DE" term="%22dynamic+programming+algorithm%22">dynamic programming algorithm</searchLink><br /><searchLink fieldCode="DE" term="%22polynomial+algorithm%22">polynomial algorithm</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+involving+graphs+or+networks%22">Programming involving graphs or networks</searchLink><br /><searchLink fieldCode="DE" term="%22quasi-polynomial+algorithm%22">quasi-polynomial algorithm</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: Summary: The author presents three new models of combinatorial optimization problems. Especially, a polynomial algorithm and a quasi-polynomial algorithm are given, their complexities are \(O(N^2)\) and \(O(N^2a)\), respectively.
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: Article
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: application/xml
– Name: URL
  Label: Access URL
  Group: URL
  Data: <link linkTarget="URL" linkTerm="https://zbmath.org/1382333" linkWindow="_blank">https://zbmath.org/1382333</link>
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsair.c2b0b933574d..bf50db6e2bcbe0cb93bc1fea499b1333
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsair&AN=edsair.c2b0b933574d..bf50db6e2bcbe0cb93bc1fea499b1333
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Text: Undetermined
    Subjects:
      – SubjectFull: Combinatorial optimization
        Type: general
      – SubjectFull: dynamic programming algorithm
        Type: general
      – SubjectFull: polynomial algorithm
        Type: general
      – SubjectFull: Programming involving graphs or networks
        Type: general
      – SubjectFull: quasi-polynomial algorithm
        Type: general
    Titles:
      – TitleFull: A class of special combinatorial optimization problems and their algorithms
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Luo, Zongjun
    IsPartOfRelationships:
      – BibEntity:
          Identifiers:
            – Type: issn-locals
              Value: edsair
ResultId 1