Pages that link to "Item:Q2354428"
From MaRDI portal
The following pages link to Fast method for verifying Chernikov rules in Fourier-Motzkin elimination (Q2354428):
Displaying 5 items.
- How to find the convex hull of all integer points in a polyhedron? (Q2162699) (← links)
- Two variations of graph test in double description method (Q2322740) (← links)
- On facet-inducing inequalities for combinatorial polytopes (Q5374012) (← links)
- Accelerating Fourier–Motzkin elimination using bit pattern trees (Q5865333) (← links)
- Wald, QLR, and score tests when parameters are subject to linear inequality constraints (Q6108338) (← links)
