scientific article; zbMATH DE number 934534

zbMATH Open0854.65040MaRDI QIDQ4895233FDOQ4895233

Authors: Bertrand LeCun, Catherine Roucairol 

Publication date: 22 January 1997

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

quadratic assignment problemtravelling salesman problemparallel implementationdiscrete optimization problemspartial lockingirregular data structurestree search strategiesbest first branch and bound

Mathematics Subject Classification ID

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

Cited In (6)

• On hash-based work distribution methods for parallel best-first search
• Weighted Binary Trees for Concurrent Searching
• Concurrency and trie hashing
• Title not available (Why is that?)
• A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization
• Data structures for mergeable trees

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)