Using symmetry to optimize over the Sherali-Adams relaxation

DOI10.1007/S12532-014-0072-0zbMATH Open1302.90134OpenAlexW2038977125MaRDI QIDQ482114FDOQ482114

James P. Ostrowski

Publication date: 19 December 2014

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-014-0072-0

Recommendations

• Using symmetry to optimize over the Sherali-Adams relaxation
• Symmetry in integer linear programming
• Symmetry in mathematical programming
• Algorithms for highly symmetric linear and integer programs
• Orbital shrinking

zbMATH Keywords

symmetryinteger programmingbranch and boundextended formulations

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Symmetry groups, semidefinite programs, and sums of squares
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
• Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
• Title not available (Why is that?)
• Optimizing over the first Chvátal closure
• A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• Title not available (Why is that?)
• Orbital branching
• A level-2 reformulation-linearization technique bound for the quadratic assignment problem
• Title not available (Why is that?)
• Solving large Steiner Triple Covering Problems
• Optimizing over the split closure
• Improving Discrete Model Representations via Symmetry Considerations
• Football Pools--A Game for Mathematicians
• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
• Algorithms for highly symmetric linear and integer programs
• On the separation of disjunctive cuts
• Pruning by isomorphism in branch-and-cut
• Exploiting orbits in symmetric ILP
• Orbitopal Fixing
• Improved Bounds for the Crossing Numbers of Km,n and Kn
• Lexicography and degeneracy: Can a pure cutting plane algorithm work?
• The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
• A new lower bound for the football pool problem for six matches
• Improving bounds on the football pool problem by integer programming and high-throughput computing
• Title not available (Why is that?)

Cited In (1)

• A new lift-and-project operator

Uses Software

• nauty
• CPLEX
• QSopt_ex
• QSopt-Exact

This page was built for publication: Using symmetry to optimize over the Sherali-Adams relaxation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482114)