Pages that link to "Item:Q662305"

The following pages link to Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305):

Displaying 27 items.

• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
• Stabilizer-based symmetry breaking constraints for mathematical programs (Q486387) (← links)
• Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305) (← links)
• Exploiting symmetries in mathematical programming via orbital independence (Q829174) (← links)
• Variable symmetry breaking in numerical constraint problems (Q900305) (← links)
• Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains (Q1668799) (← links)
• A computational comparison of symmetry handling methods for mixed integer programs (Q1741126) (← links)
• Orbital shrinking: theory and applications (Q1786877) (← links)
• A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms (Q1937084) (← links)
• Packing, partitioning, and covering symresacks (Q2192122) (← links)
• Symmetry-breaking inequalities for ILP with structured sub-symmetry (Q2196292) (← links)
• Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem (Q2227540) (← links)
• Solving large Steiner Triple Covering Problems (Q2275579) (← links)
• A mathematical programming formulation for the Hartree-Fock problem on open-shell systems (Q2414124) (← links)
• Polytopes associated with symmetry handling (Q2414904) (← links)
• Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays (Q2419587) (← links)
• Valid constraints for the Point Packing in a Square problem (Q2446880) (← links)
• On solving a hard quadratic 3-dimensional assignment problem (Q2516353) (← links)
• A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters (Q2693785) (← links)
• A semidefinite relaxation based global algorithm for two-level graph partition problem (Q2698612) (← links)
• Computing symmetry groups of polyhedra (Q2827288) (← links)
• (Q2861569) (← links)
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
• Symmetry in Mathematical Programming (Q2897300) (← links)
• An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints (Q6166655) (← links)
• Finding Symmetry Groups of Some Quadratic Programming Problems (Q6191771) (← links)