The three-dimensional matching problem in kalmanson matrices

DOI10.1007/s10878-011-9426-yzbMath1275.90083OpenAlexW2121250153MaRDI QIDQ358634

Gerhard J. Woeginger, Frits C. R. Spieksma, Sergey Polyakovskiy

Publication date: 9 August 2013

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

Full work available at URL: https://doi.org/10.1007/s10878-011-9426-y

zbMATH Keywords

computational complexitycombinatorial optimizationtractable case

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (4)

The multi-stripe travelling salesman problem ⋮ New special cases of the quadratic assignment problem with diagonally structured coefficient matrices ⋮ A New Tractable Case of the QAP with a Robinson Matrix ⋮ Four-point conditions for the TSP: the complete complexity classification

Cites Work

• Unnamed Item
• Approximation algorithms for three-dimensional assignment problems with triangle inequalities
• A canonical decomposition theory for metrics on a finite set
• A solvable case of the quadratic assignment problem
• Geometric three-dimensional assignment problems
• The Steiner tree problem in Kalmanson matrices and in circulant matrices
• A note on circular decomposable metrics
• Sometimes Travelling is Easy: The Master Tour Problem
• The structure of circular decomposable metrics
• Edgeconvex Circuits and the Traveling Salesman Problem
• Reducibility among Combinatorial Problems

This page was built for publication: The three-dimensional matching problem in kalmanson matrices