Granata, Donatella -  《Optimization Letters》 - 2025,19(1) - 123～138 - 共16页

摘要： penalized reload cost. We investigate the complexity and | -mum flow problems under penalized reload cost. All |  with a minimum penalized reload cost cannot be |  the reload cost net-work. This approach considers |  that, unless P=NP, even if the reload cost matrix is

关键词： Reload cost |  Approximability |  NP-completeness |  Penalized reload cost |  Network design