A heuristic for the time constrained asymmetric linear sum assignment problem

DOI10.1007/S10878-015-9979-2MaRDI QIDQ511701zbMATH OpenOpenAlexWikidataFDO

Authors 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

heuristic searchlinear sum assignmentoptimizationprotein structure alignment

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3989103
• The Probabilistic Analysis of a Heuristic for the Assignment Problem
• Linear assignment procedures
• The constrained minimax linear assignment problem
• scientific article; zbMATH DE number 176471

Cites work

• Assignment problems.
• scientific article; zbMATH DE number 515938 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Optimal Protein Structure Alignment Using Maximum Cliques
• The auction algorithm: A distributed relaxation method for the assignment problem
• Three-dimensional reconstruction of points and lines with unknown correspondence across images
• Towards auction algorithms for large dense assignment problems

Describes a project that uses

Uses Software

• SIFT

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

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