Exploiting Symmetry in Integer Convex Optimization using Core Points

Details Exploiting Symmetry in Integer Convex Optimization using Core Points Exploiting Symmetry in Integer Convex Optimization using Core Points

2012-02-02

arxiv.org/abs/1202.0435v2

Mathematics

Optimization and Control

15 pages

Scientific paper

We consider convex programming problems with integrality constraints that are invariant under a linear symmetry group. We define a core point of such a symmetry group as an integral point for which the convex hull of its orbit does not contain integral points other than the orbit points themselves. These core points allow us to decompose symmetric integer convex programming problems. Especially for symmetric integer linear programs we describe two algorithms based on this decomposition. Using a characterization of core points for direct products of symmetric groups, we show that prototype implementations can compete with state-of-the art commercial solvers and solve an open MIPLIB problem.

Affiliated with

Also associated with

No associations

Rating

Exploiting Symmetry in Integer Convex Optimization using Core Points does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exploiting Symmetry in Integer Convex Optimization using Core Points, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exploiting Symmetry in Integer Convex Optimization using Core Points will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-187641