Design of parallel algorithms for the single resource allocation problem

DOI10.1016/S0377-2217(99)00287-8MaRDI QIDQ1584827zbMATH OpenOpenAlexFDO

Authors F. Almeida, F. Garcia, J. L. Roda, C. Rodríguez, D. G. Morales

Publication date 2000

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0377-2217(99)00287-8

zbMATH Keywords

dynamic programmingMPIparallel computingPVMresource allocation problem

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Discrete location and assignment (90B80) Dynamic programming (90C39)

Recommendations

• An approach to parallel algorithm design
• scientific article; zbMATH DE number 4064461
• scientific article; zbMATH DE number 108570
• scientific article; zbMATH DE number 53193
• Parallel algorithms for solution of problems in scheduling theory
• Some algorithms for resource allocation in multiprocessor systems
• scientific article; zbMATH DE number 107950
• scientific article; zbMATH DE number 515940
• Design and research of the parallel combinatorial algorithms

Cites work

• A study of parallel branch-and-bound algorithms with best-bound-first search
• scientific article; zbMATH DE number 43583 (Why is no real title available?)
• Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays

Cited in

(5)

• Optimal multiple-objective resource allocation using hybrid particle swarm optimization and adaptive resource bounds technique
• Ant colony optimization for the nonlinear resource allocation problem
• scientific article; zbMATH DE number 2089156 (Why is no real title available?)
• A particle swarm optimization approach to the nonlinear resource allocation problem
• Asymptotically optimal parallel resource assignment with interference

This page was built for publication: Design of parallel algorithms for the single resource allocation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584827)