Bounds for the quadratic assignment problem using the bundle method
From MaRDI portal
Publication:868474
DOI10.1007/S10107-006-0038-8zbMATH Open1278.90303OpenAlexW1986591158MaRDI QIDQ868474FDOQ868474
Authors: Renata Sotirov, Franz Rendl 
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
Recommendations
- scientific article
- scientific article; zbMATH DE number 4027174
- A new bound for the quadratic assignment problem based on convex quadratic programming
- Lower bounds for the quadratic assignment problem
- A new lower bound for the quadratic assignment problem
- A New Lower Bound for the Quadratic Assignment Problem
- Lower bounds based on linear programming for the quadratic assignment problem
- scientific article; zbMATH DE number 714532
- A Constructive Method for Improving Lower Bounds for a Class of Quadratic Assignment Problems
- Improved lower bounds for the quadratic assignment problem
Cites Work
- QAPLIB - a quadratic assignment problem library
- A Spectral Bundle Method for Semidefinite Programming
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- The quadratic assignment problem. Theory and algorithms
- Title not available (Why is that?)
- Nonlinear assignment problems. Algorithms and applications
- Local minima and convergence in low-rank semidefinite programming
- P-Complete Approximation Problems
- Semidefinite programming relaxations for the quadratic assignment problem
- Title not available (Why is that?)
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- Recent advances in the solution of quadratic assignment problems
- Solving large quadratic assignment problems on computational grids
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- How to regularize a difference of convex functions
- Title not available (Why is that?)
- Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
- A New Lower Bound Via Projection for the Quadratic Assignment Problem
- A new bound for the quadratic assignment problem based on convex quadratic programming
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- Solving large quadratic assignment problems in parallel
- A dual framework for lower bounds of the quadratic assignment problem based on linearization
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (36)
- Exact solution of two location problems via branch-and-bound
- Mathematical programming models and exact algorithms
- Title not available (Why is that?)
- Application of polynomial approximation hierarchy to quadratic assignment problem
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Numerical study of semidefinite bounds for the \(k\)-cluster problem
- A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP
- An iterative scheme for valid polynomial inequality generation in binary polynomial programming
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- A low-dimensional semidefinite relaxation for the quadratic assignment problem
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
- Beating the SDP bound for the floor layout problem: a simple combinatorial idea
- A proximal DC approach for quadratic assignment problem
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
- Semidefinite approximations for quadratic programs over orthogonal matrices
- A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases
- Disjunctive Cuts for Nonconvex MINLP
- An algorithm for the generalized quadratic assignment problem
- Dynamic bundle methods
- Knapsack problem with probability constraints
- Taking advantage of symmetry in some quadratic assignment problems
- Sinkhorn Algorithm for Lifted Assignment Problems
- Local minima and convergence in low-rank semidefinite programming
- SDP relaxations for some combinatorial optimization problems
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- Title not available (Why is that?)
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- Semidefinite programming and eigenvalue bounds for the graph partition problem
- Exact solution methods for the \(k\)-item quadratic knapsack problem
- ADMM for the SDP relaxation of the QAP
- A new relaxation framework for quadratic assignment problems based on matrix splitting
- Product assortment and space allocation strategies to attract loyal and non-loyal customers
Uses Software
This page was built for publication: Bounds for the quadratic assignment problem using the bundle method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868474)
