A new algorithm for solving a special matching problem with a general form value function under constraints

DOI10.1134/S0005117919010077zbMath1431.91261OpenAlexW2931410178WikidataQ128122698 ScholiaQ128122698MaRDI QIDQ2287164

A. N. Khlyupin, D. V. Uzhegov, P. V. Lomovitskii, A. A. Anan'ev

Publication date: 23 January 2020

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117919010077

zbMATH Keywords

quadratic assignment problemDijkstra's algorithminvalid matchingsshortest path in graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Matching models (91B68)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Wiener maximum quadratic assignment problem
• Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices
• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
• A genetic approach to the quadratic assignment problem
• Assignment Problems and the Location of Economic Activities
• Assignment Problems
• A new algorithm for the assignment problem
• P-Complete Approximation Problems
• The alternating basis algorithm for assignment problems

This page was built for publication: A new algorithm for solving a special matching problem with a general form value function under constraints