Handling symmetries in mixed-integer semidefinite programs

DOI10.1007/978-3-031-33271-5_5MaRDI QIDQ6057246zbMATH OpenOpenAlexFDO

Authors Christopher Hojny, Marc E. Pfetsch

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

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

Cites work

• scientific article; zbMATH DE number 3654142 (Why is no real title available?)
• A computational comparison of symmetry handling methods for mixed integer programs
• A framework for solving mixed-integer semidefinite programs
• A tree-search algorithm for mixed integer programming problems
• Computational mixed-integer semidefinite programming
• Engineering an efficient canonical labeling tool for large and sparse graphs
• Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
• Exploiting group symmetry in truss topology optimization
• Exploiting orbits in symmetric ILP
• Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Maximum stable set formulations and heuristics based on continuous optimization
• On the Shannon capacity of a graph
• Orbital branching
• Polytopes associated with symmetry handling
• Practical graph isomorphism. II.
• Sparse learning via Boolean relaxations
• Symmetry groups, semidefinite programs, and sums of squares
• Symmetry in integer linear programming

Cited in

(5)

• On Integrality in Semidefinite Programming for Discrete Optimization
• Symmetry detection in mixed-integer conic programming
• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• Symmetry in semidefinite programs
• Instance-specific linear relaxations of semidefinite optimization problems

This page was built for publication: Handling symmetries in mixed-integer semidefinite programs

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