id: 01778409
dt: j
an: 01778409
au: Shi, Hailin
ti: Study on the polynomial-time algorithms of NP complete problems.
so: Math. Appl. 14, Suppl., 107-112 (2001).
py: 2001
pu: Editorial Board of Mathematica Applicata, Huazhong University of Science
    and Technology, Wuhan
la: ZH
cc: 
ut: NP complete problem; LP technics; polynomial time algorithm; Hamilton
    circuit; travelling salesman problem; group
ci: 
li: 
ab: Summary: The polynomial time algorithms of the NP complete (NPC) problems
    gained in the algebraical and combinatorial two aspects, respectively.
    The Linear Programming (LP) techniques was inefficient in the past,
    which was used analyzed the Traveling Salesman Problem (TSP). A layer
    network is developed in the paper there are another type (uncomplete)
    subtours. However, the intersect set of the feasible solution sets of
    the two models don’t contain the two subtours basic feasible
    solution, hence the TSP is solved in polynomial time using LP
    techniques. Meanunile, a polynomial-time method is gived to search a
    Hamilton circuit in a graph. Therefore, a new area to analyze the NPC
    problem is developed.
rv: