Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《中国科学A辑(英文版)》 1992-05
Add to Favorite Get Latest Update


XU YA-PING;CHEN KAI-ZHOU Department of Mathematics, Hanzhong Teachers College, Hanzhong 723001, PRC Xi'an University of Electronic Science and Technology, Xi'an 710071, PRC  
In this paper, by the optimization method, we establish the integer programming mod-els of several famous problems of graph theory, such as the necessary and sufficient condi-tion of a graph (or digraph) being a Hamiltonian graph, a Hamiltonian circuit which has aminimal total weight on a weighted graph (or digraph) and so on. Those difficult problemscan be solved by any of the integer programming algorithms.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
Chinese Journal Full-text Database 10 Hits
1 Wang ZhirenDepartment of Mathematics and Physics Liu YufengDepartment of Computer and Information Engineering;The Simulative Annealing Algorithm for the Problem of the Maximum Independent Set of Graph[J];;1997-03
2 Zhuo Zhongchang; Liu Yufeng(Dept.of Computer);Research for The Maximum Independent Set Problem of Graph Based on The Principle of Neural Network[J];;1995-04
3 Luo Shifeng (Coll.of Comp.& Info.Engi.,Guangxi Univ.,Nanning,Guangxi,530004,China);A Supplement of the Complexity of Graph Isomorphism Test[J];Journal of Guangxi Academy of Sciences;2004-03
4 SUN QiangSHEN JjanhuaGU Junzhong( Dept. of Computer Science and Technology, East China Normal University, Shanghai 200062);An Efficient Enumerating Algorithm of Generating All Heaps[J];Computer Engineering;2002-06
5 SUN QiangWANG RenwuHUANG Guoxing(Dept. of Computer Science and Technology, East China Normal University, Shanghai 200062);A New Algorithm of the Shortest Path ProblemWith Single Restriction and Multiple Weights[J];Computer Engineering;2002-08
6 YANG Zheng-ling(School of Electrical Engineering & Automation,Tianjin University,Tianjin 300072,China);Cryptology and Non-deterministic Turing Machine[J];Journal of China Academy of Electronics and Information Technology;2008-06
7 Liu Yuangxin(Department of Computer Science And Technology,Nanchang University,Nanchang,330047);PROGRAM\ TESTING[J];JOURNAL OF NANCHANG UNIVERSITY(NATURAL SCIENCE);1996-04
8 WU Shengli(Institute of Sofware The Chinese Academp of Sciences Beijing 100080)WANG Nengbin(Department of Computer Science and Engineering Southeast University Nanjing 210096);OPTIMIZATION OF "ASSOCIATE-SELECT" COMPOUND OPERATION IN OBJECT-ORIENTED; DATABASE SYSTEMS[J];JOURNAL OF SOFTWARE;1997-12
9 YU Li yong & LI Shu guang (School of Math.and System Science,Shandong Univ.,Jinan 250100,Shandong,China);Approximation Scheme for a Kind of Shortest Path Problem with Two Additional Constraints[J];Journal of Shandong University(Natural Science);2002-04
10 Liu Hong;Li Xiangyang; Sun Tianlin (1)Department of Computer Science,Shandong Normal University,250014,Jinan,PRC;2)The Teaching Affairs Section,Shandong Normal University,250014,Jinan,PRC);THE EXPLORATION ON THE IMPLEMENT OF UNIVERSITY CURRICULUM TABLE MANAGEMENT USING AIPRINCIPLE[J];JOURNAL OF SHANDONG NORMAL UNIVERSITY (NATURAL SCIENCE);1995-04
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved