The three-dimensional matching problem in kalmanson matrices (Q358634): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-011-9426-y / rank
Normal rank
 
Property / cites work
 
Property / cites work: A canonical decomposition theory for metrics on a finite set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on circular decomposable metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of circular decomposable metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for three-dimensional assignment problems with triangle inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sometimes Travelling is Easy: The Master Tour Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solvable case of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edgeconvex Circuits and the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem in Kalmanson matrices and in circulant matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric three-dimensional assignment problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-011-9426-Y / rank
 
Normal rank

Latest revision as of 15:17, 9 December 2024

scientific article
Language Label Description Also known as
English
The three-dimensional matching problem in kalmanson matrices
scientific article

    Statements

    Identifiers