Fundamental Domains for Integer Programs with Symmetries

Abstract

We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward way to construct fundamental domains defined by the maximization of a linear function. The computation of this fundamental domain is at worst polynomial in the size of the group… (More)
DOI: 10.1007/978-3-540-73556-4_17

Topics

  • Presentations referencing similar topics