This paper discusses a re-examinatlon of dual methods based on Gomory＇s cutting plane for the solution of the integer programming problem, in which the increment of objection function is allowed as a pivot variable t...This paper discusses a re-examinatlon of dual methods based on Gomory＇s cutting plane for the solution of the integer programming problem, in which the increment of objection function is allowed as a pivot variable to decide the search direction and stepsize. Meanwhile, we adopt the current equivalent face technique so that lattices are found in the discrete integral face and stronger valid inequalities are acquired easily.展开更多
This paper discusses the total irredundance relations between the graph G and its clone-contraction graph H, that is, let H be the clone-contraction graph of G and v1,v2,...,vk be all contraction vertices ofH. IfS is ...This paper discusses the total irredundance relations between the graph G and its clone-contraction graph H, that is, let H be the clone-contraction graph of G and v1,v2,...,vk be all contraction vertices ofH. IfS is a maximal total irredundant set of H such that A = S ∩ {V1,V2,…,Vk} contains as few vertices as possible, then S＇= S-A is the maximal total irredundant set of G. Furthermore, we obtain the bound of the total irredundance A（G） number： irt ≤△（G）/2△（G）＋1 n, which n is the order of graph G, and △（G） is maximum degree in G.展开更多
We present an improved method. If we assume that the objective function is twice continuously differentiable and uniformly convex, we discuss global and superlinear convergence of the improved quasi-Newton method.
基金Supported by the National Natural Science Foun-dation of China (70371032) the Doctor Educational Foundation ofthe Ministry of Education (20020486035)
文摘This paper discusses a re-examinatlon of dual methods based on Gomory＇s cutting plane for the solution of the integer programming problem, in which the increment of objection function is allowed as a pivot variable to decide the search direction and stepsize. Meanwhile, we adopt the current equivalent face technique so that lattices are found in the discrete integral face and stronger valid inequalities are acquired easily.
基金Supported by the National Natural Science Foundation of China (10571071,10371048)
文摘This paper discusses the total irredundance relations between the graph G and its clone-contraction graph H, that is, let H be the clone-contraction graph of G and v1,v2,...,vk be all contraction vertices ofH. IfS is a maximal total irredundant set of H such that A = S ∩ {V1,V2,…,Vk} contains as few vertices as possible, then S＇= S-A is the maximal total irredundant set of G. Furthermore, we obtain the bound of the total irredundance A（G） number： irt ≤△（G）/2△（G）＋1 n, which n is the order of graph G, and △（G） is maximum degree in G.
文摘We present an improved method. If we assume that the objective function is twice continuously differentiable and uniformly convex, we discuss global and superlinear convergence of the improved quasi-Newton method.
