9787313245779 - 【速发】排序问题的数学规划松弛方法 (1 risultati)
- Rilegato
Da: liu xing, Nanjing, JS, Cinaliu xing
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 100,88
EUR 15,41 spedizioneSpedito da Cina a U.S.A.Quantità: 3 disponibili
Hardcover. Condizione: New. HardCover.Pub Date:2021-05-01 Pages:187 Language:Chinese Publisher:Shanghai Jiaotong University Press For the NP-hard sorting problem. the study of its approximate algorithm is not only an important part of the sorting theory. it has profound theoretical significance. but also promotes It is the key t…o the application of sorting theory and has extensive practical application value. Mathematical programming relaxation method is an important method that can be used to design approximate algorit.
