Projection Results for the k-Partition Problem
Jamie Fairbrother (J.Fairbrotherlancaster.ac.uk)
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 them into a suitable subspace, we obtain the polytopes associated with the `node-and-edge' formulation. This result enables us to derive new valid inequalities, new separation algorithms, and a new semidefinite programming relaxation.
Keywords: graph partitioning, branch-and-cut, semidefinite programming
Category 1: Combinatorial Optimization (Polyhedra )
Category 2: Combinatorial Optimization (Branch and Cut Algorithms )
Citation: J. Fairbrother & A.N. Letchford (2017) Projection results for the k-partition problem. Discrete Optimization, 26, 97-111.
Entry Submitted: 03/12/2016
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|