Pages that link to "Item:Q1411610"
From MaRDI portal
The following pages link to Small covering designs by branch-and-cut (Q1411610):
Displayed 19 items.
- Orbitopal fixing (Q408377) (← links)
- A tabu search algorithm for the covering design problem (Q415558) (← links)
- Orbital branching (Q623461) (← links)
- Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305) (← links)
- Packing and partitioning orbitopes (Q925263) (← links)
- A computational comparison of symmetry handling methods for mixed integer programs (Q1741126) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- Algorithms for finding generalized minimum aberration designs (Q2349095) (← 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)
- A note on a symmetrical set covering problem: the lottery problem (Q2462109) (← links)
- Classification of orthogonal arrays by integer programming (Q2475747) (← links)
- Variable neighborhood descent heuristic for covering design problem (Q2840773) (← links)
- Symmetry in Mathematical Programming (Q2897300) (← links)
- Constraint Orbital Branching (Q3503850) (← links)
- Integer Programming for Classifying Orthogonal Arrays (Q5374250) (← links)
- Automatic Generation of Symmetry-Breaking Constraints (Q5505671) (← links)
- (Q5708518) (← links)
- The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program (Q5739901) (← links)