Klee–Minty cube

Known as: Klee-Minty polytope, Klee-Minty, Klee Minty cube 
The Klee–Minty cube or Klee–Minty polytope (named after Victor Klee and George J. Minty) is a unit hypercube of variable dimension whose corners have… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Kitahara and Mizuno (2010) get two upper bounds for the number of different basic feasible solutions generated by Dantzig’s… (More)
  • figure 1
  • figure 2
Is this relevant?
2008
2008
By refining a variant of the Klee–Minty example that forces the central path to visit all the vertices of the Klee–Minty n-cube… (More)
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
2008
2008
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We present a new symbolic execution tool, KLEE, capable of automatically generating tests that achieve high coverage on a diverse… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2007
2007
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the simplex path… (More)
  • figure 3
  • figure 5
  • figure 7
  • figure 8
Is this relevant?
2007
2007
An infinite sequence of 0’s and 1’s evolves by flipping each 1 to a 0 exponentially at rate one. When a 1 flips, all bits to its… (More)
Is this relevant?
2006
2006
Optimization Methods and Software Publication details, including instructions for authors and subscription information: http… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2006
2006
We consider a family of linear optimization problems over the ndimensional Klee-Minty cube and show that the central path may… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2002
2002
Although the Simplex Method (SM) developed for Dantzig is efficient for solving many linear programming problems (LPs), there are… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2001
Highly Cited
2001
It is often too expensive to compute and materialize a complete high-dimensional data cube. Computing an iceberg cube, which… (More)
Is this relevant?