A fault-tolerant parallel heuristic for assignment problems
Authors:
- E-G. TalbiETE-G. Talbi
- J-M. GeibJGJ-M. Geib
- Z. HafidiZHZ. Hafidi
- D. KebbalDKD. Kebbal
- 1 January 1998
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 306-314
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Comparison of iterative searches for the quadratic assignment problemLocation Science, 1995
- Parallel processing on dynamic resources with CARMILecture Notes in Computer Science, 1995
- The quadratic assignment problem: A survey and recent developments1994
- Supercomputing out of recycled garbage1992
- Finding idle machines in a workstation-based distributed systemIEEE Transactions on Software Engineering, 1989
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- Using idle workstations in a shared computing environmentACM SIGOPS Operating Systems Review, 1987
- Distributed snapshotsACM Transactions on Computer Systems, 1985
- Optimization by Simulated AnnealingScience, 1983