scientific article; zbMATH DE number 5026826
From MaRDI portal
Publication:5468359
zbMath1137.90585MaRDI QIDQ5468359
Publication date: 26 May 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (2)
Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem ⋮ Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem
This page was built for publication: