Projection results for the -partition problem

Abstract

The k-partition problem is an NP-hard combinatorial optimisation problem with many applications. Chopra and Rao introduced two integer programming formulations of this problem, one having both node and edge variables, and the other having only edge variables. We show that, if we take the polytopes associated with the ‘edge-only’ formulation, and project… (More)
DOI: 10.1016/j.disopt.2017.08.001

Topics

  • Presentations referencing similar topics