scientific article
From MaRDI portal
zbMath0803.20010MaRDI QIDQ4026491
Publication date: 21 February 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
combinatorial optimizationapproximation algorithmsymmetric groupgeneral linear groupconvex polytopesNP-hard problemslinear programming problemsreal representationsconvex hulls of orbitspolynomial-time problems
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05) Representations of finite symmetric groups (20C30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
A unified FFT-based approach to maximum assignment problems related to transitive finite group actions, Permutation polytopes and indecomposable elements in permutation groups, All 0-1 polytopes are traveling salesman polytopes, An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations, Geometry, complexity, and combinatorics of permutation polytopes, Selected topics on assignment problems, The QAP-polytope and the star transformation, A performance guarantee heuristic for electronic components placement problems including thermal effects, Linear optimization over permutation groups
