HIGHLIGHTS
- who: Mikhail Y. Kovalyov from the United Institute of Informatics Problems, National Academy of Sciences of, Surganova, Belarusian State University, Nezavisimosti Institute of Information Systems, Faculty III, University of Siegen, Siegen, Germany have published the research work: Cost minimizing planning of container inspection and repair in multiple facilities, in the Journal: (JOURNAL)
- what: The authors aim to minimize a cost combination, in which the demand satisfaction can be prioritized. The authors demonstrate in this section that the problem CMCF with no rejection is solvable in O(n) time if F=0, T=1 and all . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.