Using symmetry to optimize over the Sherali-Adams relaxation
type: Item
instance of: scholarly article
title: Using symmetry to optimize over the Sherali-Adams relaxation
zbMATH Open document ID: 1302.90134
author: James P. Ostrowski
published in: Mathematical Programming Computation
publication date: 2014-12-19T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6381890
zbMATH Keywords: integer programming
zbMATH Keywords: extended formulations
zbMATH Keywords: symmetry
zbMATH Keywords: branch and bound
describes a project that uses: QSopt_ex
describes a project that uses: CPLEX
describes a project that uses: QSopt-Exact
describes a project that uses: nauty
MaRDI profile type: Publication
full work available at URL: s12532-014-0072-0
OpenAlex ID: W2038977125
cites work: A level-2 reformulation-linearization technique bound for the quadratic assignment problem
cites work: A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
cites work: Optimizing over the split closure
cites work: Algorithms for highly symmetric linear and integer programs
cites work: Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
cites work: New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
cites work: Improved Bounds for the Crossing Numbers of Km,n and Kn
cites work: Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
cites work: Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
cites work: Optimizing over the first Chvátal closure
cites work: On the separation of disjunctive cuts
cites work: Q4124603
cites work: Symmetry groups, semidefinite programs, and sums of squares
cites work: Football Pools--A Game for Mathematicians
cites work: Orbitopal Fixing
cites work: Reformulations in mathematical programming: automatic symmetry detection and exploitation
cites work: Improving bounds on the football pool problem by integer programming and high-throughput computing
cites work: Q4242012
cites work: Q4273608
cites work: Pruning by isomorphism in branch-and-cut
cites work: Exploiting orbits in symmetric ILP
cites work: Q4026151
cites work: A new lower bound for the football pool problem for six matches
cites work: Orbital branching
cites work: Solving large Steiner Triple Covering Problems
cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
cites work: Improving Discrete Model Representations via Symmetry Considerations
cites work: The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
cites work: Lexicography and degeneracy: Can a pure cutting plane algorithm work?
DOI: 10.1007/S12532-014-0072-0
description: scientific article; zbMATH DE number 6381890