PARALLEL IMPRECISE ITERATIVE DEEPENING FOR COMBINATORIAL OPTIMIZATION

DOI10.1142/S0129053391000048zbMATH Open0724.90054OpenAlexW1990647624MaRDI QIDQ5202514

Tao Li

Publication date: 1991

Published in: International Journal of High Speed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129053391000048

zbMATH Keywords

quadratic assignmentgeneralized assignmentinadmissible heuristicsparallel Iterative Deepening

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15)

Related Items (1)

Efficient hybrid explicit-implicit learning for multiscale problems

This page was built for publication: PARALLEL IMPRECISE ITERATIVE DEEPENING FOR COMBINATORIAL OPTIMIZATION

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