The central path visits all the vertices of the Klee-Minty cube. - Antoine Deza; Eissa Nematollahi; M. Reza Peyghami; Tamás Terlaky (Optim. Methods Softw., 2006)

How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds. - Antoine Deza; Eissa Nematollahi; Tamás Terlaky (Math. Program., 2008)

A simpler and tighter redundant Klee-Minty construction. - Eissa Nematollahi; Tamás Terlaky (Optim. Lett., 2008)

A redundant Klee-Minty construction with all the redundant constraints touching the feasible region. - Eissa Nematollahi; Tamás Terlaky (Oper. Res. Lett., 2008)

Linear location-inventory models for service parts logistics network design. - Fatma Gzara; Eissa Nematollahi; Abdullah Dasci (Comput. Ind. Eng., 2014)