A New Tractable Case of the QAP with a Robinson Matrix

DOI10.1007/978-3-319-26626-8_52zbMath1384.90079OpenAlexW2400583499MaRDI QIDQ5743542

Eranda Çela, Vladimir G. Deǐneko, Gerhard J. Woeginger

Publication date: 5 February 2016

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_52

zbMATH Keywords

combinatorial optimizationquadratic assignmentMonge matrixKalmanson matrixRobinsoniancut matrix

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (2)

Reconstruction of line-embeddings of graphons ⋮ New special cases of the quadratic assignment problem with diagonally structured coefficient matrices

Cites Work

• Unnamed Item
• Unnamed Item
• The three-dimensional matching problem in kalmanson matrices
• The Wiener maximum quadratic assignment problem
• A canonical decomposition theory for metrics on a finite set
• A solvable case of the quadratic assignment problem
• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
• The Steiner tree problem in Kalmanson matrices and in circulant matrices
• The quadratic assignment problem. Theory and algorithms
• Another well-solvable case of the QAP: maximizing the job completion time variance
• Combinatorial optimization and hierarchical classifications
• The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
• Perspectives of Monge properties in optimization
• Well-solvable cases of the QAP with block-structured matrices
• Sub-dominant theory in numerical taxonomy
• Mathematical classification and clustering
• Combinatorial Data Analysis
• Assignment Problems and the Location of Economic Activities
• Assignment Problems
• Three easy special cases of the euclidean travelling salesman problem
• Sometimes Travelling is Easy: The Master Tour Problem
• The structure of circular decomposable metrics
• Edgeconvex Circuits and the Traveling Salesman Problem
• Balancing profits and costs on trees

This page was built for publication: A New Tractable Case of the QAP with a Robinson Matrix