Algorithms – ESA 2005

DOI10.1007/11561071MaRDI QIDQ5475892zbMATHOpenAlexFDO

Authors Alain Faye, Frédéric Roupin

Publication date 27 June 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Semidefinite programming (90C22)

Recommendations

• A low-dimensional semidefinite relaxation for the quadratic assignment problem
• scientific article; zbMATH DE number 1894380
• Semidefinite programming relaxations for the quadratic assignment problem
• Generating cutting planes for the semidefinite relaxation of quadratic programs
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes

Cited in

(5)

• A dynamical systems approach to weighted graph matching
• Un Algorithme De Génération De Coupes Pour Le Problème De L’Affectation Quadratique
• Solving \(k\)-cluster problems to optimality with semidefinite programming
• Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
• Generating cutting planes for the semidefinite relaxation of quadratic programs

Describes a project that uses

Uses Software

• QAPLIB
• Benchmarks for Optimization Software
• SDP_S

This page was built for publication: Algorithms – ESA 2005

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