scientific article; zbMATH DE number 1783769
From MaRDI portal
Publication:4546186
zbMath1001.90070MaRDI QIDQ4546186
Publication date: 19 August 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
(n)-dimensional polytopes (52B11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (4)
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 ⋮ Types of maximum noninteger vertices of the relaxation polyhedron of the four-index axial assignment problem ⋮ Polyhedral combinatorics of multi-index axial transportation problems
This page was built for publication:
