Polynomially solvable special cases of the quadratic bottleneck assignment problem

DOI10.1007/s10878-010-9333-7zbMath1236.90064arXiv1401.1633OpenAlexW2059476057MaRDI QIDQ411238

Roswitha Rissner, Rainer E. Burkard

Publication date: 4 April 2012

Published in: Journal of Combinatorial Optimization, Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.1633

zbMATH Keywords

centermedianradiuscentroidbottleneck Monge matrixmax-conequadratic bottleneck assignment problemmidpointsstatus

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80) Distance in graphs (05C12)

Related Items (7)

Minimum status of series-reduced trees with given parameters ⋮ Status connectivity indices of line graphs ⋮ Proximity, remoteness and maximum degree in graphs ⋮ Unnamed Item ⋮ Minimum status of trees with a given degree sequence ⋮ A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints ⋮ Which numbers are status differences?

Cites Work

• Generators, extremals and bases of max cones
• Perspectives of Monge properties in optimization
• Assignment Problems and the Location of Economic Activities

This page was built for publication: Polynomially solvable special cases of the quadratic bottleneck assignment problem