Tri-skill variant Simplex and strongly polynomial-time algorithm for linear programming-Reference-Cited by-同舟云学术

Tri-skill variant Simplex and strongly polynomial-time algorithm for linear programming

Published:2021-12-14 Issue: Volume: Page:
ISSN:
Container-title:IEEE/WIC/ACM International Conference on Web Intelligence
language:
Short-container-title:

Author:

Pei-zhuang Wang¹,Jing He²,Qi-wei Kong²,Shi Yong³

Affiliation:

1. Liaoning Technical University, China

2. Nanjing University of Finance and Economics, China

3. Research Center on Fictitious Economy & Data Science, China

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3486622.3493971

Reference17 articles.

1. [1] P. Z. Wang , H. T. Liu , Factor Space , the Mathematical Bases of Artificial Intelligence, [M]Beijing , Beijing University of Posts and Telecommunications Press , 2021 . [1]P. Z. Wang, H. T. Liu, Factor Space, the Mathematical Bases of Artificial Intelligence, [M]Beijing, Beijing University of Posts and Telecommunications Press, 2021.

2. [2]L. J. Pu F. H. Zeng P. Z. Wang classification of Basis pings in factor space. Journal of Intelligent Systems (accepted). [2]L. J. Pu F. H. Zeng P. Z. Wang classification of Basis pings in factor space. Journal of Intelligent Systems (accepted).

3. Task Allocation Optimization in Collaborative Customized Product Development Based on Adaptive Genetic Algorithm

4. [4] G.B. Dantzig , Linear Programming and Extensions , Princeton University Press , Princeton, New Jersey, 1963 . [4]G.B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, New Jersey, 1963.

5. [5] V. Klee and G.J. Minty . How good is the Simplex method . In O. Shisha, ed., Inequalities III , Academic Press , New York, NY , 1972 . [5]V. Klee and G.J. Minty. How good is the Simplex method. In O. Shisha, ed., Inequalities III, Academic Press, New York, NY, 1972.