On the Assignment Polytope

Cited in

(48)

Linear optimization over permutation groups
Clique facets of the axial and planar assignment polytopes
Strong tree-cographs are Birkhoff graphs
Hamiltonicity and combinatorial polyhedra
Discrete extremal problems
The monotonic diameter of the perfect matching and shortest path polytopes
On the connectivity of Cayley graphs
Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n)
Convex polyhedra of doubly stochastic matrices. IV
Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
On the truncated assignment polytope
On removing a vertex from the assignment polytope
Adjacency on the constrained assignment problem
The monotonic diameter of traveling salesman polytopes
The hierarchy of circuit diameters and transportation polytopes
The diameters of network-flow polytopes satisfy the Hirsch conjecture
Adjacency on combinatorial polyhedra
Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron
Finding the dimension of a non-empty orthogonal array polytope
On the connectivity of Cayley digraphs
On multi-index assignment polytopes
A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
A new linearization method for quadratic assignment problems
A proof of the maximal diameter conjecture for the transportation polyhedron
On the diameter of partition polytopes and vertex-disjoint cycle cover
Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme
Edge-Connectivity on the Assignment Polytope
Some relations between neighbourhood graphs for a permutation problem
The Hirsch conjecture for the fractional stable set polytope
On the circuit diameter of some combinatorial polytopes
Good clusterings have large volume
Stochastic load balancing on unrelated machines
Partial permutation and alternating sign matrix polytopes
Birkhoff-von Neumann graphs that are PM-compact
Constructing Clustering Transformations
Adjacent Extreme Points Of A Transportation Polytope
A note on certain subpolytopes of the assignment polytope associated with circulant graphs
The QAP-polytope and the star transformation
A normal fan projection algorithm for low-rank optimization
On the diameter of a 2-sum of polyhedra
Geometry, complexity, and combinatorics of permutation polytopes
Faces of the signed Birkhoff polytopes
On the permutation polytopes of some cyclic groups
Path odd-covers of graphs
Combinatorics of generalized parking-function polytopes
On the integrality gap of small asymmetric traveling salesman problems: a polyhedral and computational approach
On permutation polytopes
Permutation polytopes and indecomposable elements in permutation groups

This page was built for publication: On the Assignment Polytope

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