The Rank-One Quadratic Assignment Problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3451687 (Why is no real title available?)
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
- An FPTAS for minimizing the product of two non-negative linear cost functions
- An FPTAS for optimizing a class of low-rank functions over a polytope
- An -approximation scheme for combinatorial optimization problems with minimum variance criterion
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Assignment Problems and the Location of Economic Activities
- Breakout local search for the quadratic assignment problem
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Cut generation through binarization
- Easy and difficult objective functions for max cut
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Linear multiplicative programming
- Network flows. Theory, algorithms, and applications.
- On linear multiplicative programming.
- Quadratic programming and combinatorial minimum weight product problems
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems
- Resource-Constrained Assignment Scheduling
- Solving mixed integer bilinear problems using MILP formulations
- The Complexity of Enumeration and Reliability Problems
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- The quadratic assignment problem
- The quadratic assignment problem. Theory and algorithms
- Weighted graphs with all Hamiltonian cycles of the same length
- ``Binarize and project to generate cuts for general mixed-integer programs
Cited in
(3)
This page was built for publication: The Rank-One Quadratic Assignment Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085471)
