Pages that link to "Item:Q1942261"
From MaRDI portal
The following pages link to Algorithms for highly symmetric linear and integer programs (Q1942261):
Displaying 22 items.
- Exploiting symmetries for scaling loopy belief propagation and relational training (Q374162) (← links)
- Exploiting symmetries for single- and multi-agent partially observable stochastic domains (Q456732) (← links)
- Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
- Relational linear programming (Q511779) (← links)
- On a class of strongly asymmetric PKA algorithms (Q745105) (← links)
- Exploiting orbits in symmetric ILP (Q1424276) (← links)
- A computational comparison of symmetry handling methods for mixed integer programs (Q1741126) (← links)
- Orbital shrinking: theory and applications (Q1786877) (← links)
- Constructing an artificial basis in the symmetric linear programming problems (Q1909099) (← links)
- On lattice-free orbit polytopes (Q2256587) (← links)
- Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays (Q2419587) (← links)
- Exploiting symmetry in integer convex optimization using core points (Q2450624) (← links)
- Symmetric ILP: Coloring and small integers (Q2471273) (← links)
- Computing symmetry groups of polyhedra (Q2827288) (← links)
- Exploiting Symmetries in Polyhedral Computations (Q2849003) (← links)
- Greedy algorithms for high-dimensional non-symmetric linear problems (Q3451670) (← links)
- On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data (Q4385160) (← links)
- Equivalence of Lattice Orbit Polytopes (Q4564021) (← links)
- Fundamental Domains for Symmetric Optimization: Construction and Search (Q5003215) (← links)
- On the geometry of symmetry breaking inequalities (Q5918422) (← links)
- On the geometry of symmetry breaking inequalities (Q5925642) (← links)
- Finding Symmetry Groups of Some Quadratic Programming Problems (Q6191771) (← links)
