earticle

논문검색

The Research to Regular Sequences of Similar Algorithm Based on Sparse Linear

원문정보

초록

영어

The main idea of Regular Sequences of Similar Algorithm based on Sparse Linear (HR Algorithm) is to calculation the near optimal solution from the solution of sparse integer programming model. The advantages of HR algorithm are simplifying the problem of huge solution space of integer programming, reducing the number of goal constraints, and turning the problem into a simplified integer programming. The near optimal solution, which is hard to apply accurate method, can be found under limited time by using HR algorithm based on regular sequences.

목차

Abstract
 1. Introduction
 2. The Executive Procedure of HR Algorithm
 3. The Algorithm Error
 4. Conclusion
 References

저자정보

  • Di Jin School of Computer and Information Engineering Harbin University of Commerce Harbin, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.