Dynamic sparsification for quadratic assignment problems

DOI10.1007/978-3-030-22629-9_17zbMath1443.90252OpenAlexW2951166131MaRDI QIDQ2181762

Maximilian John, Andreas Karrenbauer

Publication date: 19 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-22629-9_17

zbMATH Keywords

integer programminglinearizationquadratic assignmentkeyboard optimization

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (2)

Characterizing linearizable QAPs by the level-1 reformulation-linearization technique ⋮ An LP-based characterization of solvable QAP instances with chess-board and graded structures

This page was built for publication: Dynamic sparsification for quadratic assignment problems