The central path visits all the vertices of the Klee–Minty cube

Author： Deza Antoine   Nematollahi Eissa   Peyghami Reza   Terlaky Tamás  

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.21, Iss.5, 2006-10, pp. : 851-865

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Unchanging the diameter of k-ary n-cube networks with faulty vertices

By  

International Journal of Computer Mathematics, Vol. 92, Iss. 1, 2015-01 ,pp. : 15-28

Taylor & Francis Ltd

Access to resources Recommend Favorite

Uncountable graphs with all their vertices in one face

By Boza Luis   Fedriani Eugenio M.   Núńez Juan  

Acta Mathematica Hungarica, Vol. 112, Iss. 4, 2006-09 ,pp. : 307-313

Springer Publishing Company

Access to resources Recommend Favorite

Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree

By Henning Michael   Plummer Michael  

Journal of Combinatorial Optimization, Vol. 10, Iss. 3, 2005-11 ,pp. : 283-294

Springer Publishing Company

Access to resources Recommend Favorite

Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs

By Hota Mrinmoy   Pal Madhumangal   Pal Tapan K.  

Computational Optimization and Applications, Vol. 27, Iss. 1, 2004-01 ,pp. : 95-113

Springer Publishing Company

Access to resources Recommend Favorite

An efficient distributed algorithm for finding all hinge vertices in networks

By Ho Ting-yem  

International Journal of Computer Mathematics, Vol. 82, Iss. 7, 2005-07 ,pp. : 821-825

Taylor & Francis Ltd

Access to resources Recommend Favorite