Maximizing Polynomials Subject to Assignment Constraints

DOI10.1007/978-3-642-22006-7_43zbMATH Open1334.68302OpenAlexW2102514177MaRDI QIDQ3012829FDOQ3012829

Maxim Sviridenko, Konstantin Makarychev

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximating the minimum quadratic assignment problems
• Assignment Problems and the Location of Economic Activities
• Efficient probabilistically checkable proofs and applications to approximations
• Real-time dispatch of trams in storage yards
• The quadratic assignment problem
• Estimating \(L^\infty\) norms by \(L^{2k}\) norms for functions on orbits.
• Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
• A Geometric Approach to Betweenness
• Heuristics for biquadratic assignment problems and their computational comparison
• Simple linear time approximation algorithm for betweenness
• Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems
• On the Maximum Quadratic Assignment Problem
• Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm
• Approximating the maximum quadratic assignment problem

   Recommendations

• Maximizing Polynomials Subject to Assignment Constraints 👍 👎
• Polynomial optimization problems 👍 👎
• Maxpolynomial equations 👍 👎
• Max algebra and the linear assignment problem 👍 👎
• Title not available (Why is that?) 👍 👎
• Polinomiális optimalizálási feladatok és relaxációik 👍 👎
• Complete solutions and extremality criteria to polynomial optimization problems 👍 👎
• Title not available (Why is that?) 👍 👎
• Solving the equality-constrained minimization problem of polynomial functions 👍 👎

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)