Bounds for the quadratic assignment problem using the bundle method
From MaRDI portal
Publication:868474
DOI10.1007/s10107-006-0038-8zbMath1278.90303OpenAlexW1986591158MaRDI QIDQ868474
Publication date: 5 March 2007
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://research.tilburguniversity.edu/en/publications/b6d298bc-77c9-4a6d-a043-5b51f659a2a3
Related Items
Taking advantage of symmetry in some quadratic assignment problems, Copositive and semidefinite relaxations of the quadratic assignment problem, Disjunctive Cuts for Nonconvex MINLP, Mathematical Programming Models and Exact Algorithms, Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem, Dynamic bundle methods, Semidefinite approximations for quadratic programs over orthogonal matrices, Product assortment and space allocation strategies to attract loyal and non-loyal customers, A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP, Sinkhorn Algorithm for Lifted Assignment Problems, A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring, Knapsack problem with probability constraints, ADMM for the SDP relaxation of the QAP, An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming, Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems, Local minima and convergence in low-rank semidefinite programming, A new relaxation framework for quadratic assignment problems based on matrix splitting, A proximal DC approach for quadratic assignment problem, An algorithm for the generalized quadratic assignment problem, Semidefinite relaxations for partitioning, assignment and ordering problems, SDP Relaxations for Some Combinatorial Optimization Problems, Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting, A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices, Semidefinite relaxations for partitioning, assignment and ordering problems, A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem, Exact Solution Methods for the k-Item Quadratic Knapsack Problem, Exact Solution of Two Location Problems via Branch-and-Bound, Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition, Semidefinite programming and eigenvalue bounds for the graph partition problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
- How to regularize a difference of convex functions
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- QAPLIB - a quadratic assignment problem library
- Solving large quadratic assignment problems in parallel
- The quadratic assignment problem. Theory and algorithms
- Semidefinite programming relaxations for the quadratic assignment problem
- Recent advances in the solution of quadratic assignment problems
- Nonlinear assignment problems. Algorithms and applications
- Solving large quadratic assignment problems on computational grids
- A dual framework for lower bounds of the quadratic assignment problem based on linearization
- Local minima and convergence in low-rank semidefinite programming
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A New Lower Bound Via Projection for the Quadratic Assignment Problem
- P-Complete Approximation Problems
- A Spectral Bundle Method for Semidefinite Programming
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- A new bound for the quadratic assignment problem based on convex quadratic programming
