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

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος:	Towards a parallel implementation of CPLEX using a pseudo-cost repository.
Συγγραφείς:	Tamvada, Srinivas Subramanya¹ (AUTHOR) sst119@psu.edu, Hassini, Elkafi² (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

Full Text Finder

καταχωρήστε σχόλιο πρώτοι!