On Resource Constrained Optimization Problems
msra(2003)
摘要
This paper shows that a method that has long been used to solve Resource Constrained Optimization Problems and found extremely effective in practice, is effective in the theoretical sense as well, it is proved to be strongly polynomial. In the special case of Resource Constrained Shortest Path Problem a better running time estimation is also presented.
更多查看译文
关键词
strongly polynomial algorithms,lagrangian relaxation,resource constrained optimization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络