Polynomial algorithms for solving the quadratic bottleneck assignment problem on networks

zbMATH Open1249.90228MaRDI QIDQ3115274FDOQ3115274

Authors: Gennady Grigorjevich Zabudsky, A. Yu. Lagzdin 

Publication date: 20 February 2012

Recommendations

• Polynomial algorithms for solving the quadratic assignment problem on networks
• Polynomially solvable special cases of the quadratic bottleneck assignment problem
• A contribution to quadratic assignment problems
• Quadratic bottleneck problems
• The quadratic assignment problem. Theory and algorithms

zbMATH Keywords

graphpolynomial algorithmlocation problemquadratic bottleneck assignment problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cited In (4)

• Polynomially solvable special cases of the quadratic bottleneck assignment problem
• Polynomial algorithms for the synthesis of bounded nets
• Title not available (Why is that?)
• Polynomial algorithms for solving the quadratic assignment problem on networks

This page was built for publication: Polynomial algorithms for solving the quadratic bottleneck assignment problem on networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115274)