Design of parallel algorithms for the single resource allocation problem

DOI10.1016/S0377-2217(99)00287-8zbMath0969.90058OpenAlexW2075964758MaRDI QIDQ1584827

J. L. Roda, C. Rodríguez, F. García, F. Almeida, 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

MPIdynamic programmingparallel computingresource allocation problemPVM

Mathematics Subject Classification ID

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

Related Items (3)

A particle swarm optimization approach to the nonlinear resource allocation problem ⋮ Optimal multiple-objective resource allocation using hybrid particle swarm optimization and adaptive resource bounds technique ⋮ Ant colony optimization for the nonlinear resource allocation problem

Cites Work

• Unnamed Item
• A study of parallel branch-and-bound algorithms with best-bound-first search
• Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays

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