Structure of a simple scheduling polyhedron
Mathematical Programming: Series A and B
Equivalence of permutation polytopes corresponding to strictly supermodular functions
Discrete Applied Mathematics
Equivalence of permutation polytopes corresponding to strictly supermodular functions
Discrete Applied Mathematics
Hi-index | 0.04 |
This paper demonstrates a strong equivalence of all permutation polytopes corresponding to strictly supermodular functions.