The three-dimensional matching problem in Kalmanson matrices

Sergey Polyakovskiy (), Frits C. R. Spieksma () and Gerhard J. Woeginger ()
Additional contact information
Sergey Polyakovskiy: Katholieke Universiteit Leuven
Frits C. R. Spieksma: Katholieke Universiteit Leuven
Gerhard J. Woeginger: TU Eindhoven

Journal of Combinatorial Optimization, 2013, vol. 26, issue 1, No 1, 9 pages

Abstract: Abstract We investigate the computational complexity of several special cases of the three-dimensional matching problem where the costs are decomposable and determined by a so-called Kalmanson matrix. For the minimization version we develop an efficient polynomial time algorithm that is based on dynamic programming. For the maximization version, we show that there is a universally optimal matching (whose structure is independent of the particular Kalmanson matrix).

Keywords: Computational complexity; Combinatorial optimization; Tractable case (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-011-9426-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:26:y:2013:i:1:d:10.1007_s10878-011-9426-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-011-9426-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().