scientific article; zbMATH DE number 1446757

MaRDI QIDQ4953913zbMATH OpenFDO

Authors Gábor Magyar, Mika Johnsson, Olli S. Nevalainen

Publication date 14 May 2000

zbMATH Keywords

branch and bound algorithmlinear programmingmedian problemsNP-completenessthree-matching problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 1202983
• On the weighted Euclidean matching problem in R^d
• New primal and dual matching heuristics
• Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances
• scientific article; zbMATH DE number 1003267

Cited in

(5)

• The Euclidean Matching Problem
• The three-dimensional matching problem in kalmanson matrices
• scientific article; zbMATH DE number 1202983 (Why is no real title available?)
• The Euclidean k-matching problem is NP-hard
• Maximum bounded 3-dimensional matching is MAX SNP-complete

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953913)