A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy

  • Authors:

  • Ravindra K. Ahuja;Horst W. Hamacher

  • Affiliations:

  • Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611;Fachbereich Mathematik, Universitaet Kaiserslautern, Kurt Schumacher Str. 26, D-67653 Kaiserslautern, Germany

  • Venue:
  • Networks
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this article, we study the modulation of intensity matrices arising in cancer radiation therapy using multileaf collimators. This problem can be formulated by decomposing a given m × n integer matrix into a positive linear combination of (0, 1) matrices with the strict consecutive 1's property in rows. We consider a special case in which no technical constraints have to be taken into account. In this situation, the rows of the intensity matrix are independent of each other and the problem is equivalent to decomposing m intensity rows—independent of each other—into positive linear combinations of (0, 1) rows with the consecutive 1's property. We demonstrate that this problem can be transformed into a minimum cost flow problem in a directed network that has the following special structures: (1) the network is acyclic; (2) it is a complete graph (that is, there is an arc (i, j) whenever i j); (3) each arc cost is 1; and (4) each arc is uncapacitated (that is, it has infinite capacity). We show that using this special structure, the minimum cost flow problem can be solved in O(n) time. Because we need to solve m such problems, the total running time of our algorithm is O(nm), which is an optimal algorithm to decompose a given m × n integer matrix into a positive linear combination of (0, 1) matrices. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 45(1), 36–41 2005