Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Parallel branch and bound on fine-grained hypercube multiprocessors

From MaRDI portal
Publication:916373
Jump to:navigation, search

DOI10.1016/0167-8191(90)90043-9zbMath0703.68050OpenAlexW2152202394MaRDI QIDQ916373

Afonso G. Ferreira, Frank Dehne, Andrew Rau-Chaplin

Publication date: 1990

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(90)90043-9


zbMATH Keywords

branch and boundparallel algorithmsload balancinghypercube multiprocessorsfine grained systemprocess allocation


Mathematics Subject Classification ID

General topics in the theory of software (68N01) Distributed algorithms (68W15)


Related Items (2)

Parallel algorithms for a multi-level network optimization problem ⋮ Parallel processing for difficult combinatorial optimization problems




This page was built for publication: Parallel branch and bound on fine-grained hypercube multiprocessors

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:916373&oldid=12883642"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 17:15.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki