scientific article; zbMATH DE number 1795730
From MaRDI portal
Publication:4550779
Recommendations
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- scientific article; zbMATH DE number 714527
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- scientific article; zbMATH DE number 970341
- Lower bounds based on linear programming for the quadratic assignment problem
Cited in
(13)- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- scientific article; zbMATH DE number 714527 (Why is no real title available?)
- Taking advantage of symmetry in some quadratic assignment problems
- Faster first-order primal-dual methods for linear programming using restarts and sharpness
- Constrained 0-1 quadratic programming: basic approaches and extensions
- A survey for the quadratic assignment problem
- Measuring instance difficulty for combinatorial optimization problems
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- An algorithm for the generalized quadratic assignment problem
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
- A revised reformulation-linearization technique for the quadratic assignment problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4550779)
