View in EDS HTML Full Text PDF Full Text

Regularized standard polynomial programming formulations for the maximum clique problem.

Saved in:
Bibliographic Details
Title: Regularized standard polynomial programming formulations for the maximum clique problem.
Authors: Makovenko, Mykyta1, makovenko@tamu.edu, Butenko, Sergiy1, butenko@tamu.edu, Pardalos, Miltiades1, apardalos@tamu.edu
Source: Computational Optimization & Applications; Dec2025, Vol. 92 Issue 3, p923-949, 27p
Database: Applied Science & Technology Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: aci
DbLabel: Applied Science & Technology Source
An: 189681710
AccessLevel: 2
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Regularized standard polynomial programming formulations for the maximum clique problem.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AU" term="%22Makovenko%2C+Mykyta%22">Makovenko, Mykyta</searchLink><relatesTo>1</relatesTo>, <i>makovenko@tamu.edu</i><br /><searchLink fieldCode="AU" term="%22Butenko%2C+Sergiy%22">Butenko, Sergiy</searchLink><relatesTo>1</relatesTo>, <i>butenko@tamu.edu</i><br /><searchLink fieldCode="AU" term="%22Pardalos%2C+Miltiades%22">Pardalos, Miltiades</searchLink><relatesTo>1</relatesTo>, <i>apardalos@tamu.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Computational+Optimization+%26+Applications%22">Computational Optimization & Applications</searchLink>; Dec2025, Vol. 92 Issue 3, p923-949, 27p
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=aci&AN=189681710
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10589-025-00674-z
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 27
        StartPage: 923
    Titles:
      – TitleFull: Regularized standard polynomial programming formulations for the maximum clique problem.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Makovenko, Mykyta
      – PersonEntity:
          Name:
            NameFull: Butenko, Sergiy
      – PersonEntity:
          Name:
            NameFull: Pardalos, Miltiades
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 12
              Text: Dec2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 09266003
          Numbering:
            – Type: volume
              Value: 92
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Computational Optimization & Applications
              Type: main
ResultId 1