| 注册
首页|期刊导航|襄樊学院学报|求解C-A指派问题的差值法

求解C-A指派问题的差值法

李敏

襄樊学院学报2011,Vol.32Issue(8):21-23,54,4.
襄樊学院学报2011,Vol.32Issue(8):21-23,54,4.

求解C-A指派问题的差值法

Difference Value Method for C-A Assignment Problem

李敏1

作者信息

  • 1. 襄樊学院数学与计算机科学学院,湖北襄阳441053
  • 折叠

摘要

Abstract

In the light of the complicated calculating situation of the Hungary algorithm solving C-A assignment problem, a new and simple method is put forward. First it finds out the feasible solution by difference value method and then optimal solution can be found through the row and column revisions. Compared with the present calculating method, the new method is easier and more feasible.

关键词

C-A指派问题/匈牙利法/差值法

Key words

C-A assignment problem/Hungary algorithm/Difference value method

分类

数理科学

引用本文复制引用

李敏..求解C-A指派问题的差值法[J].襄樊学院学报,2011,32(8):21-23,54,4.

基金项目

襄樊学院科学研究资助项目 ()

襄樊学院学报

OACHSSCD

2095-4476

访问量0
|
下载量0
段落导航相关论文