The independent quadratic assignment problem: complexity and polynomially solvable special cases
From MaRDI portal
Cites work
- A bilinear programming formulation of the 3-dimensional assignment problem
- A characterization of linear admissible transformations for the m- travelling salesmen problem
- A characterization of linearizable instances of the quadratic minimum spanning tree problem
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- An \(O(n^{4})\) algorithm for the QAP linearization problem
- Approximation algorithms for the Euclidean bipartite TSP
- Assignment Problems
- Assignment Problems and the Location of Economic Activities
- Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis
- Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
- Combinatorial optimization with interaction costs: complexity and solvable cases
- Complexity of a 3-dimensional assignment problem
- Domination analysis of combinatorial optimization problems.
- HAMILTONian circuits in chordal bipartite graphs
- scientific article; zbMATH DE number 3694608 (Why is no real title available?)
- scientific article; zbMATH DE number 3451687 (Why is no real title available?)
- Linearizable special cases of the QAP
- Maximization of A convex quadratic function under linear constraints
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
- Polynomially solvable cases of the bipartite traveling salesman problem
- SC-Hamiltonian graphs and digraphs: new necessary conditions and their impacts
- SC-Hamiltonicity and its linkages with strong Hamiltonicity of a graph
- The bilinear assignment problem: complexity and polynomially solvable special cases
- The bipartite quadratic assignment problem and extensions
- The constant objective value property for multidimensional assignment problems
- The quadratic assignment problem
- 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
- The quadratic cycle cover problem: special cases and efficient bounds
- The Rank-One Quadratic Assignment Problem
- The traveling salesman problem and its variations
- Weighted graphs with all Hamiltonian cycles of the same length
This page was built for publication: The independent quadratic assignment problem: complexity and polynomially solvable special cases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6976850)
