English

Vertex Structure of Master Corner Polyhedra

Combinatorics 2011-04-26 v1

Abstract

This paper focuses on vertices of the master corner polyhedra P(G,g0),P(G,g_0), the core of the group-theoretical approach to integer linear programming. We introduce two combinatorial operations that transform each vertex of P(G,g0)P(G,g_0) to adjacent ones. This implies that for any P(G,g0),P(G,g_0), there exists a subset of basic vertices, we call them support vertices, from which all others can be built. The class of support vertices is proved to be invariant under the automorphism group of G,G, so this basis can be further reduced to a subset of pairwise non-equivalent support vertices. Among other results, we characterize irreducible points of the master corner polyhedra, establish relations between an integer point and the nontrivial facets that pass through it, construct complete subgraphs of the graph of P(G,g0),P(G,g_0), and show that these polyhedra are of diameter 2.

Keywords

Cite

@article{arxiv.1104.4569,
  title  = {Vertex Structure of Master Corner Polyhedra},
  author = {Vladimir A. Shlyk},
  journal= {arXiv preprint arXiv:1104.4569},
  year   = {2011}
}

Comments

33 pages, 35 tables in the Appendix

R2 v1 2026-06-21T17:58:03.708Z