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