Some Fixed-Point Results for the Dynamic Assignment Problem |
| |
Authors: | Michael Z Spivey Warren B Powell |
| |
Institution: | 1. Department of Mathematics and Computer Science, Samford University, Birmingham, AL, 35229, USA 2. Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ, 08544, USA
|
| |
Abstract: | In previous work the authors consider the dynamic assignment problem, which involves solving sequences of assignment problems over time in the presence of uncertain information about the future. The algorithm proposed by the authors provides generally high-quality but non-optimal solutions. In this work, though, the authors prove that if the optimal solution to a dynamic assignment problem in one of two problem classes is unique, then the optimal solution is a fixed point under the algorithm. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|