scientific article; zbMATH DE number 934533

MaRDI QIDQ4895232zbMATHFDO

Authors Leonidas Pitsoulis, Panos M. Pardalos, Mauricio G. C. Resende

Publication date 22 January 1997

zbMATH Keywords

parallel implementationgreedy randomized adaptive search procedurelarge-scale sparse quadratic assignment problems

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 714537
• A parallel branch and bound algorithm for the quadratic assignment problem
• scientific article; zbMATH DE number 724213
• Solving large quadratic assignment problems in parallel

Cited in

(10)

• scientific article; zbMATH DE number 2090689 (Why is no real title available?)
• FaSa: A fast and stable quadratic placement algorithm
• A cooperative parallel tabu search algorithm for the quadratic assignment problem
• Metaheuristics: A bibliography
• A GRASP for the biquadratic assignment problem
• Expanding neighborhood GRASP for the traveling salesman problem
• Tracking elementary particles near their primary vertex: A combinatorial approach
• Solving large quadratic assignment problems on computational grids
• scientific article; zbMATH DE number 724213 (Why is no real title available?)
• Parallel Greedy Randomized Adaptive Search Procedures

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