Academic Journal
Προβολή σε EDS

Towards a parallel implementation of CPLEX using a pseudo-cost repository.

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Towards a parallel implementation of CPLEX using a pseudo-cost repository.
Συγγραφείς: Tamvada, Srinivas Subramanya1 (AUTHOR) sst119@psu.edu, Hassini, Elkafi2 (AUTHOR)
Πηγή: INFOR. Jun2026, p1-20. 20p. 6 Illustrations.
Θεματικοί όροι: *Parallel programming, *Scalability, *Distributed computing, Mixed integer linear programming, Optimization algorithms
Περίληψη: AbstractPseudo-cost based branching is a popular branching strategy used by Mixed Integer Programming (MIP) solvers. This strategy relies on pseudo-cost updates from various parts of the search tree for making accurate branching decisions. Since such updates are not instantly available during a distributed computation, parallel MIP solver implementations that use pseudo-cost branching may not perform well when the underlying cluster is scaled horizontally. To address this issue, we propose integrating a repository of pre-calculated pseudo-costs into a parallel implementation of CPLEX. Although all the facilities needed for such an implementation are currently not available, experiments with hard-to-solve instances indicate that the proposed implementation can help limit the number of nodes explored during the distributed computation. [ABSTRACT FROM AUTHOR]
Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Βάση Δεδομένων: Business Source Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://resolver.ebsco.com/c/fiv2js/result?sid=EBSCO:bsx&genre=article&issn=03155986&ISBN=&volume=&issue=&date=20260606&spage=1&pages=1-20&title=INFOR&atitle=Towards%20a%20parallel%20implementation%20of%20CPLEX%20using%20a%20pseudo-cost%20repository.&aulast=Tamvada%2C%20Srinivas%20Subramanya&id=DOI:10.1080/03155986.2026.2679345
    Name: Full Text Finder (for New FTF UI) (ns324271)
    Category: fullText
    Text: Full Text Finder
    MouseOverText: Full Text Finder
Header DbId: bsx
DbLabel: Business Source Index
An: 194572037
RelevancyScore: 1435
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1435
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Towards a parallel implementation of CPLEX using a pseudo-cost repository.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Tamvada%2C+Srinivas+Subramanya%22">Tamvada, Srinivas Subramanya</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> sst119@psu.edu</i><br /><searchLink fieldCode="AR" term="%22Hassini%2C+Elkafi%22">Hassini, Elkafi</searchLink><relatesTo>2</relatesTo> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22INFOR%22">INFOR</searchLink>. Jun2026, p1-20. 20p. 6 Illustrations.
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: *<searchLink fieldCode="DE" term="%22Parallel+programming%22">Parallel programming</searchLink><br />*<searchLink fieldCode="DE" term="%22Scalability%22">Scalability</searchLink><br />*<searchLink fieldCode="DE" term="%22Distributed+computing%22">Distributed computing</searchLink><br /><searchLink fieldCode="DE" term="%22Mixed+integer+linear+programming%22">Mixed integer linear programming</searchLink><br /><searchLink fieldCode="DE" term="%22Optimization+algorithms%22">Optimization algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: AbstractPseudo-cost based branching is a popular branching strategy used by Mixed Integer Programming (MIP) solvers. This strategy relies on pseudo-cost updates from various parts of the search tree for making accurate branching decisions. Since such updates are not instantly available during a distributed computation, <italic>parallel</italic> MIP solver implementations that use pseudo-cost branching may not perform well when the underlying cluster is scaled horizontally. To address this issue, we propose integrating a repository of pre-calculated pseudo-costs into a parallel implementation of CPLEX. Although all the facilities needed for such an implementation are currently not available, experiments with hard-to-solve instances indicate that the proposed implementation can help limit the number of nodes explored during the distributed computation. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=bsx&AN=194572037
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1080/03155986.2026.2679345
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 20
        StartPage: 1
    Subjects:
      – SubjectFull: Parallel programming
        Type: general
      – SubjectFull: Scalability
        Type: general
      – SubjectFull: Distributed computing
        Type: general
      – SubjectFull: Mixed integer linear programming
        Type: general
      – SubjectFull: Optimization algorithms
        Type: general
    Titles:
      – TitleFull: Towards a parallel implementation of CPLEX using a pseudo-cost repository.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Tamvada, Srinivas Subramanya
      – PersonEntity:
          Name:
            NameFull: Hassini, Elkafi
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 06
              M: 06
              Text: Jun2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 03155986
          Titles:
            – TitleFull: INFOR
              Type: main
ResultId 1