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

DOI10.1007/BF01585694zbMath0751.90051OpenAlexW2041011899MaRDI QIDQ1184337

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

parametric programmingquadratic assignmenteigenvalue decompositionsteepest ascent algorithm

Mathematics Subject Classification ID

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

Related Items (23)

Strengthening Gilmore's bound for the quadratic assignment problem ⋮ Lower bounds for the quadratic assignment problem ⋮ A new exact algorithm for the solution of quadratic assignment problems ⋮ Solving the max-cut problem using eigenvalues ⋮ A survey for the quadratic assignment problem ⋮ A projection technique for partitioning the nodes of a graph ⋮ Stochastic consensus dynamics for nonconvex optimization on the Stiefel manifold: Mean-field limit and convergence ⋮ Bounds for the quadratic assignment problem using the bundle method ⋮ Lower bounds for the quadratic assignment problem via triangle decompositions ⋮ A survey of hidden convex optimization ⋮ A parallel depth first search branch and bound algorithm for the quadratic assignment problem ⋮ Norms on complex matrices induced by complete homogeneous symmetric polynomials ⋮ Sinkhorn Algorithm for Lifted Assignment Problems ⋮ Best ellipsoidal relaxation to solve a nonconvex problem. ⋮ Diffusion bank networks and capital flows ⋮ Graph Similarity and Approximate Isomorphism ⋮ On improving convex quadratic programming relaxation for the quadratic assignment problem ⋮ Laplace eigenvalues of graphs---a survey ⋮ Selected topics on assignment problems ⋮ A new relaxation framework for quadratic assignment problems based on matrix splitting ⋮ Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem ⋮ Lower bounds based on linear programming for the quadratic assignment problem ⋮ Network-based formulations of the quadratic assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A parallel branch and bound algorithm for the quadratic assignment problem
• Bounds for eigenvalues using traces
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• The variation of the spectrum of a normal matrix
• The spread of a matrix
• Matrix Analysis
• Optimization and nonsmooth analysis
• On linear programs with random costs
• On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
• P-Complete Approximation Problems
• Eigenvalue perturbations and nonlinear parametric optimization
• Validation of subgradient optimization
• Convex Analysis

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