Symmetry in Mathematical Programming
From MaRDI portal
Publication:2897300
DOI10.1007/978-1-4614-1927-3_9zbMath1242.90236OpenAlexW2188668454MaRDI QIDQ2897300
Publication date: 10 July 2012
Published in: Mixed Integer Nonlinear Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-1927-3_9
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items
A generic optimization framework for resilient systems, Exploiting symmetries in mathematical programming via orbital independence, Workforce planning incorporating skills: state of the art, Orbital Independence in Symmetric Mathematical Programs, A mathematical programming formulation for the Hartree-Fock problem on open-shell systems, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, Valid constraints for the Point Packing in a Square problem, Exploiting symmetry in integer convex optimization using core points, Stabilizer-based symmetry breaking constraints for mathematical programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Interval analysis on directed acyclic graphs for global optimization
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Packing and partitioning orbitopes
- Symmetry in semidefinite programs
- Compact mathematical formulation for graph partitioning
- On implementing symmetry detection
- Pruning by isomorphism in branch-and-cut
- Small covering designs by branch-and-cut
- Exploiting orbits in symmetric ILP
- Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
- Group symmetry in interior-point methods for semidefinite program
- Symmetry groups, semidefinite programs, and sums of squares
- New formulations for the Kissing Number Problem
- The kissing number in four dimensions
- Symmetric ILP: Coloring and small integers
- Unsolvability of some optimization problems
- Some polyhedra related to combinatorial problems
- Das Problem der dreizehn Kugeln
- On a Binary-Encoded ILP Coloring Formulation
- Improving Discrete Model Representations via Symmetry Considerations
- Extended Formulations for Packing and Partitioning Orbitopes
- Branching and bounds tighteningtechniques for non-convex MINLP
- Constraint Orbital Branching
- Symmetry Definitions for Constraint Satisfaction Problems
- Automatic Detection of Variable and Value Symmetries
- New upper bounds for kissing numbers from semidefinite programming
- Fundamental Domains for Integer Programs with Symmetries
- Reformulations in Mathematical Programming: Definitions and Systematics
- Constructive Group Relaxations for Integer Programs
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Complete search in continuous global optimization and constraint satisfaction
- A Novel Approach For Detecting Symmetries in CSP Models
- Detecting Orbitopal Symmetries
- Orbital Branching
- Automatic Generation of Symmetry-Breaking Constraints
- Recent Advances in Constraints
- Solving a Matrix Game by Linear Programming
- A Combinatorial Algorithm for Linear Programs in the General Mixed Form
- Variable neighborhood search: Principles and applications
