| 一个置换极值问题 |
| |
| 引用本文： | 梁莉莉.一个置换极值问题[J].广西民族大学学报,2006,12(4):72-76. |
| |
| 作者姓名： | 梁莉莉 |
| |
| 作者单位： | 广西民族大学,数学与计算机科学学院,广西,南宁,530006 |
| |
| 摘 要： | 研究一个车队探险问题的推广,证明了这个问题等价于一个置换极值问题,得到了最优解的一组必要条件.设计了一个近似算法,并提出了若干公开问题,且对一般的置换极值问题做了初步讨论.
|
| 关 键 词： | 最优化 线性规划 置换 近似算法 |
| 文章编号： | 1007-0311（2006）04-0072-05 |
| 收稿时间： | 2006-08-30 |
| 修稿时间： | 2006-08-30 |
A Problem of Permutation Optimization |
| |
| LIANG Li-li.A Problem of Permutation Optimization[J].Journal of Guangxi University For Nationalities(Natural Science Edition),2006,12(4):72-76. |
| |
| Authors: | LIANG Li-li |
| |
| Institution: | College of Mathematics and Computer Science Guangxi University for Nationalities, Nanning 530006, China |
| |
| Abstract: | In this paper,a generalization of a traffic problem is discussed.It has been proved that this problem is equivalent to a problem of permutation optimization.A system of necessary conditions for the optimal solution is given.An approximate algorithm is designed,and some open problems are proposed. |
| |
| Keywords: | optimization linear programming permutation approximate algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
