scientific article; zbMATH DE number 1163098

zbMATH Open0903.90123MaRDI QIDQ4394587FDOQ4394587

Jens Clausen

Publication date: 29 July 1998

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

zbMATH Keywords

graph partitioningparallel algorithmsbranch-and-boundquadratic assignment

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Integer programming (90C10)

Cited In (6)

• PICO: An object-oriented framework for parallel branch and bound
• Can Parallel Branch and Bound without Communication Be Effective?
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
• Experiments with parallel branch-and-bound algorithms for the set covering problem
• PEBBL: an object-oriented framework for scalable parallel branch and bound

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