Algorithms on Discrete Near Optimal Partitions : Applications in Higher Dimensional Domain Decomposition, Intensity Modulated Radiation Therapy (IMRT) including Arc Therapy (IMAT)

ISBN-13: 9783639115765 / Angielski / Miękka / 2009 / 132 str.

Athula Gunawardena

Opis

In practice, many NP-hard combinatorial optimization problems can be formulated as partitioning problems.In such a formulation, each component in thepartition is assigned with a numerical objectivevalue and the objective function is defined as afunction on the numerical values assigned. Theoptimization problem is to minimize or maximize the objective function on all possible partitionsthat satisfy certain constraints. A feasiblepartition (i.e., a partition that satisfy all theconstraints) with the optimal objective value iscalled an optimal partition. A near-optimal partitionis a partition with an objective value close to theoptimal value. In a partitioning problem, byexploiting the properties of the underlying domain, one may be able to construct efficientheuristic algorithms to produce near-optimalpartitions. We present algorithms for applications inHigher Dimensional Domain Decomposition, IntensityModulated Radiation Therapy (IMRT) includingIntensity Modulated Arc Therapy (IMAT)

O autorze

Athula D. Gunawardena:BS(EE, U. of Peradeniya, Sri Lanka),
Ph.D.(Mathematics, U. of Wyoming), Ph.D.(Computer Sciences, U. of
Wisconsin-Madison), Associate Professor at U. of
Wisconsin-Whitewater. Robert R. Meyer: Ph.D.(U. of
Wisconsin-Madison), Professor Emeritus of Computer Sciences, U.
of Wisconsin-Madison.