Maximizing Polynomials Subject to Assignment Constraints

DOI10.1007/978-3-642-22006-7_43MaRDI QIDQ3012829zbMATH OpenOpenAlexFDO

Authors Konstantin Makarychev, Maxim Sviridenko

Publication date 6 July 2011

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22006-7_43

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
• Polynomial optimization problems
• Maxpolynomial equations
• Max algebra and the linear assignment problem
• scientific article; zbMATH DE number 475484
• Polynomial optimization problems and their relaxations
• Complete solutions and extremality criteria to polynomial optimization problems
• scientific article; zbMATH DE number 3920213
• Solving the equality-constrained minimization problem of polynomial functions

Cites work

• scientific article; zbMATH DE number 714527 (Why is no real title available?)
• scientific article; zbMATH DE number 714530 (Why is no real title available?)
• A Geometric Approach to Betweenness
• Approximating the maximum quadratic assignment problem
• Approximating the minimum quadratic assignment problems
• Assignment Problems and the Location of Economic Activities
• Beating the random ordering is hard: every ordering CSP is approximation resistant
• Efficient probabilistically checkable proofs and applications to approximations
• Estimating \(L^\infty\) norms by \(L^{2k}\) norms for functions on orbits.
• Heuristics for biquadratic assignment problems and their computational comparison
• On the maximum quadratic assignment problem
• Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems
• Real-time dispatch of trams in storage yards
• Simple linear time approximation algorithm for betweenness
• The quadratic assignment problem

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 Q3012829)