An Exact Penalty Approach to the Quadratic Assignment Problem

DOI10.1080/716067195MaRDI QIDQ4466846zbMATH OpenOpenAlexFDO

Authors P. Frank Körner

Publication date 8 June 2004

Published in Systems Analysis Modelling Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/716067195

zbMATH Keywords

exact penalty functionconvex quadratic programmingtight boundsNewton-methodquadratic Boolean programmingLagrangean-multiplier

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Discrete location and assignment (90B80)

Recommendations

• A new exact algorithm for the solution of quadratic assignment problems
• An exact algorithm for the general quadratic assignment problem
• scientific article; zbMATH DE number 5152705
• scientific article; zbMATH DE number 4143776
• Solving quadratic assignment problems using convex quadratic programming relaxations

Cited in

(6)

• An efficient continuation method for quadratic assignment problems
• An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
• Penalty weights in QUBO formulations: permutation problems
• A dynamic system approach to quadratic programming problems with penalty method
• An exact penalty approach for solving a class of minimization problems with boolean variables
• \texttt{EXPEDIS}: an exact penalty method over discrete sets

This page was built for publication: An Exact Penalty Approach to the Quadratic Assignment Problem

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