Maximizing Polynomials Subject to Assignment Constraints

DOI10.1145/3147137zbMath1451.68353OpenAlexW2769731375MaRDI QIDQ4554944

M. I. Sviridenko, Konstantin Makarychev

Publication date: 12 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3147137

zbMATH Keywords

quadratic assignment problemapproximation algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)

This page was built for publication: Maximizing Polynomials Subject to Assignment Constraints