The three-dimensional matching problem in kalmanson matrices
From MaRDI portal
Publication:358634
DOI10.1007/S10878-011-9426-YzbMATH Open1275.90083OpenAlexW2121250153MaRDI QIDQ358634FDOQ358634
Authors: Frits C. R. Spieksma, Gerhard J. Woeginger, S. 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
Recommendations
Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- Title not available (Why is that?)
- Reducibility among combinatorial problems
- A canonical decomposition theory for metrics on a finite set
- A solvable case of the quadratic assignment problem
- Geometric three-dimensional assignment problems
- Edgeconvex Circuits and the Traveling Salesman Problem
- 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
Cited In (5)
- Recognising permuted Demidenko matrices
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices
- A new tractable case of the QAP with a Robinson matrix
- The multi-stripe travelling salesman problem
- Four-point conditions for the TSP: the complete complexity classification
This page was built for publication: The three-dimensional matching problem in kalmanson matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q358634)
