The central path visits all the vertices of the Klee-Minty cube.

Antoine Deza Eissa Nematollahi M. Reza Peyghami Tamás Terlaky

Published in: Optim. Methods Softw. (2006)

Keyphrases

simplex method
linear programming
linear program
multi dimensional
shortest path
data cube
weighted graph
column generation
data structure
np hard
primal dual