| A POLYNOMIAL ALGORITHM FOR FINDING A BUMP OPTIMAL EXTENSION OF AN ORDERED SET |
| |
| 引用本文： | 李慰萱. A POLYNOMIAL ALGORITHM FOR FINDING A BUMP OPTIMAL EXTENSION OF AN ORDERED SET[J]. 系统科学与复杂性, 1991, 0(1) |
| |
| 作者姓名： | 李慰萱 |
| |
| 作者单位： | Chansha Railway |
| |
| 摘 要： | A polynomial algorithm for finding a linear extension of an ordered set which has theminimum bumps is presented.
|
A POLYNOMIAL ALGORITHM FOR FINDING A BUMP OPTIMAL EXTENSION OF AN ORDERED SET |
| |
| Li Weixuan. A POLYNOMIAL ALGORITHM FOR FINDING A BUMP OPTIMAL EXTENSION OF AN ORDERED SET[J]. Journal of Systems Science and Complexity, 1991, 0(1) |
| |
| Authors: | Li Weixuan |
| |
| Abstract: | A polynomial algorithm for finding a linear extension of an ordered set which has theminimum bumps is presented. |
| |
| Keywords: | Bump number linear extension algorithm ordered set combinatorial optimization |
| 本文献已被 CNKI 等数据库收录！ |
