9787313245779 - 【速发】排序问题的数学规划松弛方法 (1 resultados)
- Tapa dura
Librería: liu xing, Nanjing, JS, Chinaliu xing
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 100,88
Envío por EUR 15,41Se envía de China a Estados Unidos de AmericaCantidad disponible: 3 disponibles
Hardcover. Condición: 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 to… 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.
