scientific article; zbMATH DE number 857591

MaRDI QIDQ4870332zbMATH OpenFDO

Authors M. G. A. Verhoeven

Publication date 18 March 1996

zbMATH Keywords

parallel local searchparallel processingresource-constrained project schedulingSteiner treetraveling salesman

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Parallel local search
• Parallel genetic algorithms with local search
• Parallel local search for Steiner trees in graphs
• scientific article; zbMATH DE number 3889284
• scientific article; zbMATH DE number 4131978

Cited in

(14)

• Parallel and distributed local search in COMET
• Local tuning and partition strategies for diagonal GO methods
• Sequential and parallel local search for the time-constrained traveling salesman problem
• Parallel information algorithm with local tuning for solving multidimensional GO problems
• Parallel genetic algorithms with local search
• Metaheuristics: A bibliography
• Large-scale parallelism for constraint-based local search: the costas array case study
• Distributed localized bi-objective search
• scientific article; zbMATH DE number 4131978 (Why is no real title available?)
• BIT-PARALLEL COMPUTATION OF LOCAL SIMILARITY SCORE MATRICES WITH UNITARY WEIGHTS
• Parallel Local Search in Comet
• Searching for Backbones—a high-performance parallel algorithm for solving combinatorial optimization problems
• scientific article; zbMATH DE number 1884354 (Why is no real title available?)
• Improved algorithms for the Steiner problem in networks

This page was built for publication:

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