Maximizing polynomials subject to assignment constraints

DOI10.1145/3147137MaRDI QIDQ4554944zbMATH OpenOpenAlexFDO

Authors Konstantin Makarychev, Maxim Sviridenko

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) Approximation algorithms (68W25) Discrete location and assignment (90B80)

Recommendations

• Maximizing Polynomials Subject to Assignment Constraints
• On the maximum quadratic assignment problem
• On the maximum quadratic assignment problem
• A contribution to quadratic assignment problems

Cited in

(1)

• Maximizing Polynomials Subject to Assignment Constraints

This page was built for publication: Maximizing polynomials subject to assignment constraints

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