Some fixed-point results for the dynamic assignment problem

Michael Z. Spivey, Warren Buckler Powell

Research output: Contribution to journalArticle

3 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)15-33
Number of pages19
JournalAnnals of Operations Research
Volume124
Issue number1-4
DOIs
StatePublished - Nov 2003

All Science Journal Classification (ASJC) codes

  • Decision Sciences(all)
  • Management Science and Operations Research

Keywords

  • Dynamic assignment problem
  • Fixed point

Fingerprint Dive into the research topics of 'Some fixed-point results for the dynamic assignment problem'. Together they form a unique fingerprint.

  • Cite this