scientific article; zbMATH DE number 934534

MaRDI QIDQ4895233zbMATH OpenFDO

Authors Bertrand LeCun, Catherine Roucairol

Publication date 22 January 1997

zbMATH Keywords

best first branch and bounddiscrete optimization problemsirregular data structuresparallel implementationpartial lockingquadratic assignment problemtravelling salesman problemtree search strategies

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Discrete location and assignment (90B80) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 1057779
• Concurrent access of priority queues
• A study of parallel branch-and-bound algorithms with best-bound-first search
• Space-Efficient Parallel Algorithms for Combinatorial Search Problems

Cited in

(6)

• Concurrency and trie hashing
• Data structures for mergeable trees
• scientific article; zbMATH DE number 2033285 (Why is no real title available?)
• On hash-based work distribution methods for parallel best-first search
• Weighted Binary Trees for Concurrent Searching
• A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization

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 Q4895233)