期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Nonconvex Quadratic Programming Method for k-Coloring Problem:Algorithm and Computation
1
作者 Cao Jiaming(Department of Transportation Engineering) ,Southwest Jiaotong University,Chengdu 610031, China 《Journal of Modern Transportation》 1994年第2期138-145,共8页
In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above... In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above quadratic0-1 programming and its relaxed problem, k-coloring problem is converted intoa class of (continuous) nonconvex quadratic programs, and several theoreticresults are also introduced. Thirdly, linear programming approximate algorithmis quoted and verified for this class of nonconvex quadratic programs. Finally,examining problems which are used to test the algorithm are constructed andsufficient computation experiments are reported. 展开更多
关键词 k-coloring problem quadratic 0-1 programming relaxed equivalence nonconvex quadratic programming linear programming approximatealgorithm
在线阅读 下载PDF
与0-1二次规划问题等价的连续问题(英)
2
作者 朱文兴 《应用数学》 CSCD 1998年第1期68-71,共4页
在较一般的条件下,证明了线性约束0-1二次规划问题等价于一个凹二次规划问题,改进了已有的结果.
关键词 0-1二次规划 凹二次规划 二次规划 连续问题
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部