PARALLEL IMPRECISE ITERATIVE DEEPENING FOR COMBINATORIAL OPTIMIZATION

DOI10.1142/S0129053391000048MaRDI QIDQ5202514zbMATH OpenOpenAlexFDO

Authors 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

generalized assignmentinadmissible heuristicsparallel Iterative Deepeningquadratic assignment

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 278844
• Publication:3489495
• Effective use of memory in iterative deepening search
• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
• scientific article; zbMATH DE number 4162301

Cited in

(5)

• Efficient hybrid explicit-implicit learning for multiscale problems
• Ideal point guided iterative deepening
• scientific article; zbMATH DE number 4162301 (Why is no real title available?)
• scientific article; zbMATH DE number 4162302 (Why is no real title available?)
• scientific article; zbMATH DE number 278844 (Why is no real title available?)

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)