Optimization Online


Using Symmetry to Optimize Over the Sherali-Adams Relaxation

James Ostrowski (jostrows***at***utk.edu)

Abstract: In this paper we examine the impact of using the Sherali-Adams procedure on highly symmetric integer programming problems. Linear relaxations of the extended formulations generated by Sherali-Adams can be very large, containing on the order of n choose d many variables for the level-d closure. When large amounts of symmetry are present in the problem instance however, the symmetry can be used to generate a much smaller linear program that has an identical objective value. We demonstrate this by computing the bound associated with the level 1, 2, and 3 relaxations of several highly symmetric binary integer programming problems. We also present a class of constraints, called counting constraints, that further improves the bound, and in some cases provides a tight formulation.

Keywords: Integer Programming, Symmetry, RLT

Category 1: Integer Programming (0-1 Programming )


Download: [PDF]

Entry Submitted: 12/20/2011
Entry Accepted: 12/20/2011
Entry Last Modified: 07/12/2013

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society