Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem

DOI10.1007/BF01585694MaRDI QIDQ1184337zbMATH OpenOpenAlexFDO

Authors Franz Rendl, Henry Wolkowicz

Publication date 28 June 1992

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01585694

zbMATH Keywords

eigenvalue decompositionquadratic assignmentparametric programmingsteepest ascent algorithm

Mathematics Subject Classification ID

Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Boolean programming (90C09) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 3982880
• scientific article; zbMATH DE number 714534
• Special cases of the quadratic assignment problem
• Ranking scalar products to improve bounds for the quadratic assignment problem
• scientific article; zbMATH DE number 232498

Cites work

• scientific article; zbMATH DE number 3982880 (Why is no real title available?)
• scientific article; zbMATH DE number 4076973 (Why is no real title available?)
• scientific article; zbMATH DE number 3793774 (Why is no real title available?)
• A parallel branch and bound algorithm for the quadratic assignment problem
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• Bounds for eigenvalues using traces
• Convex Analysis
• Eigenvalue perturbations and nonlinear parametric optimization
• Matrix Analysis
• On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
• On linear programs with random costs
• Optimization and nonsmooth analysis
• P-Complete Approximation Problems
• The spread of a matrix
• The variation of the spectrum of a normal matrix
• Validation of subgradient optimization

Cited in

(25)

• A new exact algorithm for the solution of quadratic assignment problems
• Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
• Ranking scalar products to improve bounds for the quadratic assignment problem
• Selected topics on assignment problems
• Solving the max-cut problem using eigenvalues
• A projection technique for partitioning the nodes of a graph
• Diffusion bank networks and capital flows
• Best ellipsoidal relaxation to solve a nonconvex problem.
• scientific article; zbMATH DE number 6902579 (Why is no real title available?)
• A survey for the quadratic assignment problem
• Network-based formulations of the quadratic assignment problem
• Strengthening Gilmore's bound for the quadratic assignment problem
• Norms on complex matrices induced by complete homogeneous symmetric polynomials
• A survey of hidden convex optimization
• Laplace eigenvalues of graphs---a survey
• Lower bounds based on linear programming for the quadratic assignment problem
• Stochastic consensus dynamics for nonconvex optimization on the Stiefel manifold: mean-field limit and convergence
• Lower bounds for the quadratic assignment problem via triangle decompositions
• Bounds for the quadratic assignment problem using the bundle method
• Sinkhorn Algorithm for Lifted Assignment Problems
• On improving convex quadratic programming relaxation for the quadratic assignment problem
• A parallel depth first search branch and bound algorithm for the quadratic assignment problem
• Graph similarity and approximate isomorphism
• A new relaxation framework for quadratic assignment problems based on matrix splitting
• Lower bounds for the quadratic assignment problem

This page was built for publication: Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1184337)