Dynamic programming for the quadratic assignment problem on trees
From MaRDI portal
Publication:2261718
DOI10.1134/S0005117912020117zbMath1307.90194OpenAlexW2019291529MaRDI QIDQ2261718
A. Yu. Lagzdin, Gennady Grigorjevich Zabudsky
Publication date: 13 March 2015
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117912020117
Related Items
Algorithm for the discrete Weber's problem with an accuracy estimate ⋮ A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices
- Optimal location of branching points of a transportation network on a digital model of a region
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
- The quadratic assignment problem. Theory and algorithms
- Approximating the maximum quadratic assignment problem
- The quadratic assignment problem. I: New lower bounds in paired assignment
- Improved lower bounds for the quadratic assignment problem
- Polynomial algorithms for solving the quadratic assignment problem on networks
- Assignment Problems and the Location of Economic Activities
- On the One-Dimensional Space Allocation Problem
- Finite-State Processes and Dynamic Programming
This page was built for publication: Dynamic programming for the quadratic assignment problem on trees