Handling symmetries in mixed-integer semidefinite programs

DOI10.1007/978-3-031-33271-5_5OpenAlexW4377231287MaRDI QIDQ6057246

Marc E. Pfetsch, Christopher Hojny

Publication date: 4 October 2023

Published in: Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-33271-5_5

zbMATH Keywords

branch-and-boundmixed-integer semidefinite programmingsymmetry handling

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx)

Related Items

On Integrality in Semidefinite Programming for Discrete Optimization

Cites Work

• Orbital branching
• Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
• Exploiting group symmetry in truss topology optimization
• Maximum stable set formulations and heuristics based on continuous optimization
• Exploiting orbits in symmetric ILP
• A computational comparison of symmetry handling methods for mixed integer programs
• Symmetry groups, semidefinite programs, and sums of squares
• Sparse learning via Boolean relaxations
• Polytopes associated with symmetry handling
• Practical graph isomorphism. II.
• Symmetry in Integer Linear Programming
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• On the Shannon capacity of a graph
• A framework for solving mixed-integer semidefinite programs
• Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
• A tree-search algorithm for mixed integer programming problems
• Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
• Unnamed Item
• Unnamed Item