| 单词 |
hitchcock transportation problem |
| 释义 |
Hitchcock transportation problem Hitchcock transportation problem[¦hich‚käk ‚tranz·pər′tā·shən ‚präb·ləm] (mathematics) The problem in linear programming of minimizing the cost of moving ships between two configurations in both of which there is a specified number of ships in each of a finite number of ports, when the costs of moving one ship from each of the ports in the first configuration to each of the ports in the second are specified. |
| 随便看 |
- shubhash chandra bose
- shubhodaya center for rehabilitation of victims of torture and violence
- shubin, fedot
- shubin, fedot ivanovich
- shubinka
- shubin, pavel
- shubin, pavel nikolaevich
- shubin, semen
- shubin, semen petrovich
- shubinskii, sergei
- shubinskii, sergei nikolaevich
- shub-internet
- shubnikov, aleksei
- shubnikov, aleksei vasilevich
- shubnikov-de haas effect
- shubnikov-de haas oscillation
- shubnikov-de haas oscillations
- shubnikov groups
- shubnikov, lev
- shubnikov, lev vasilevich
- shubra el khiema
- shubrick, william branford
- shubu
- shubun
- shubunkin
|