An algorithm for finding the \(K\)-best allocations of a tree structured program
From MaRDI portal
Publication:1893670
DOI10.1006/jpdc.1995.1061zbMath0939.68946OpenAlexW2061467656MaRDI QIDQ1893670
Alain Billionnet, Sourour Elloumi
Publication date: 20 July 1995
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jpdc.1995.1061
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)
Related Items (4)
An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating ⋮ Exact solution of emerging quadratic assignment problems ⋮ Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique ⋮ An algorithm for the generalized quadratic assignment problem
This page was built for publication: An algorithm for finding the \(K\)-best allocations of a tree structured program
