The following pages link to Constraint Orbital Branching (Q3503850):
Displaying 15 items.
- Optimizing experimental design in genetics (Q353179) (← links)
- Orbitopal fixing (Q408377) (← links)
- Orbital branching (Q623461) (← links)
- Russian doll search for the Steiner triple covering problem (Q644513) (← links)
- Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305) (← links)
- The maximum \(k\)-colorable subgraph problem and orbitopes (Q666000) (← links)
- A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
- Orbital shrinking: theory and applications (Q1786877) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← 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)
- Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays (Q2419587) (← links)
- Symmetry in Mathematical Programming (Q2897300) (← links)
- Orbital Independence in Symmetric Mathematical Programs (Q3467864) (← links)
- Fundamental Domains for Symmetric Optimization: Construction and Search (Q5003215) (← links)
