Pages that link to "Item:Q1396814"

The following pages link to Pruning by isomorphism in branch-and-cut (Q1396814):

Displaying 46 items.

• Orbitopal fixing (Q408377) (← links)
• Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
• Stabilizer-based symmetry breaking constraints for mathematical programs (Q486387) (← links)
• Exact algorithms for the solution of the grey pattern quadratic assignment problem (Q494699) (← links)
• A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
• Orbital branching (Q623461) (← links)
• Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305) (← links)
• The maximum \(k\)-colorable subgraph problem and orbitopes (Q666000) (← links)
• Exploiting symmetries in mathematical programming via orbital independence (Q829174) (← links)
• In situ column generation for a cutting-stock problem (Q868997) (← links)
• Packing and partitioning orbitopes (Q925263) (← links)
• Detecting almost symmetries of graphs (Q1621684) (← links)
• Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs (Q1652711) (← links)
• Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
• A computational comparison of symmetry handling methods for mixed integer programs (Q1741126) (← links)
• A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
• Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions (Q1753550) (← links)
• Orbital shrinking: theory and applications (Q1786877) (← links)
• Algorithms for highly symmetric linear and integer programs (Q1942261) (← links)
• Insight into the computation of Steiner minimal trees in Euclidean space of general dimension (Q2064280) (← links)
• Political districting to minimize cut edges (Q2099493) (← links)
• Packing, partitioning, and covering symresacks (Q2192122) (← links)
• Solving large Steiner Triple Covering Problems (Q2275579) (← links)
• Parallel machine scheduling with tool loading (Q2290906) (← links)
• Modified orbital branching for structured symmetry with an application to unit commitment (Q2340280) (← links)
• Algorithms for finding generalized minimum aberration designs (Q2349095) (← links)
• Lexicographical order in integer programming (Q2405486) (← 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)
• Symmetric ILP: Coloring and small integers (Q2471273) (← links)
• Classification of orthogonal arrays by integer programming (Q2475747) (← links)
• Symmetry in Mathematical Programming (Q2897300) (← links)
• Orbital Independence in Symmetric Mathematical Programs (Q3467864) (← links)
• Spherical cuts for integer programming problems (Q3499437) (← links)
• Constraint Orbital Branching (Q3503850) (← links)
• Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
• Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches (Q4622891) (← links)
• Fundamental Domains for Symmetric Optimization: Construction and Search (Q5003215) (← links)
• SYMMETRIES IN MODAL LOGICS (Q5346685) (← links)
• Optimization for Power Systems and the Smart Grid (Q5351612) (← links)
• Integer Programming for Classifying Orthogonal Arrays (Q5374250) (← links)
• Automatic Generation of Symmetry-Breaking Constraints (Q5505671) (← links)
• (Q5708518) (← links)
• On the geometry of symmetry breaking inequalities (Q5918422) (← links)
• On the geometry of symmetry breaking inequalities (Q5925642) (← links)