Reformulations in mathematical programming: automatic symmetry detection and exploitation
From MaRDI portal
Publication:662305
DOI10.1007/s10107-010-0351-0zbMath1235.90103OpenAlexW2106475988MaRDI QIDQ662305
Publication date: 22 February 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0351-0
Related Items
Exploiting symmetries in mathematical programming via orbital independence, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Symmetry in Mathematical Programming, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Orbital Independence in Symmetric Mathematical Programs, Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains, A mathematical programming formulation for the Hartree-Fock problem on open-shell systems, Polytopes associated with symmetry handling, Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays, A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms, Packing, partitioning, and covering symresacks, Variable symmetry breaking in numerical constraint problems, Symmetry-breaking inequalities for ILP with structured sub-symmetry, An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints, Finding Symmetry Groups of Some Quadratic Programming Problems, A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters, A semidefinite relaxation based global algorithm for two-level graph partition problem, Valid constraints for the Point Packing in a Square problem, Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem, Reformulations in mathematical programming: automatic symmetry detection and exploitation, Using symmetry to optimize over the Sherali-Adams relaxation, Stabilizer-based symmetry breaking constraints for mathematical programs, A computational comparison of symmetry handling methods for mixed integer programs, The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program, Unnamed Item, Solving large Steiner Triple Covering Problems, Orbital shrinking: theory and applications, On solving a hard quadratic 3-dimensional assignment problem, On the geometry of symmetry breaking inequalities, On the geometry of symmetry breaking inequalities, Computing symmetry groups of polyhedra, Fundamental Domains for Symmetric Optimization: Construction and Search
Uses Software
Cites Work
- 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
- Packing and partitioning orbitopes
- Symmetry in semidefinite programs
- Compact mathematical formulation for graph partitioning
- Fundamental algorithms for permutation groups
- Pruning by isomorphism in branch-and-cut
- Small covering designs by branch-and-cut
- Exploiting orbits in symmetric ILP
- Introduction to the GiNaC framework for symbolic computation within the \(\text{C}^{++}\) programming language
- Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
- A polyhedral branch-and-cut approach to global optimization
- Symmetric ILP: Coloring and small integers
- Unsolvability of some optimization problems
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- On a Binary-Encoded ILP Coloring Formulation
- Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study
- 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
- Fundamental Domains for Integer Programs with Symmetries
- Reformulations in Mathematical Programming: Definitions and Systematics
- On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
- Complete search in continuous global optimization and constraint satisfaction
- Detecting Orbitopal Symmetries
- Orbital Branching
- Automatic Generation of Symmetry-Breaking Constraints
- Recent Advances in Constraints
