A heuristic for the time constrained asymmetric linear sum assignment problem

DOI10.1007/s10878-015-9979-2zbMath1361.90048OpenAlexW2222276508WikidataQ58041463 ScholiaQ58041463MaRDI QIDQ511701

Yong-Cai Geng, Sumit K. Garg

Publication date: 22 February 2017

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

Full work available at URL: http://hdl.handle.net/10072/101924

zbMATH Keywords

optimizationheuristic searchprotein structure alignmentlinear sum assignment

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Uses Software

• SIFT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards auction algorithms for large dense assignment problems
• The auction algorithm: A distributed relaxation method for the assignment problem
• Optimal Protein Structure Alignment Using Maximum Cliques
• Three-dimensional reconstruction of points and lines with unknown correspondence across images

This page was built for publication: A heuristic for the time constrained asymmetric linear sum assignment problem