id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
3197xk83f5r	Chao Wang	New Algorithms for Treatment Planning and Delivery Problems in Intensity-Modulated Radiation Therapy	2008		.txt	text/plain	352	9	26	In this thesis, we study a set of combinatorial and geometric problems that arise in IMRT planning and delivery: (1) the 3-D static leaf sequencing (SLS) problem, whose goal is to deliver the prescribed IMs in the minimum amount of time; (2) the 3-D static leaf sequencing with error control problem, which aims to deliver the prescribed IMs in the minimum amount of time subject to the constraint that no unnecessary machine delivery error is introduced; (3) the field splitting problems, which seek to split a large width, undeliverable IM into several deliverable sub-IMs of widths no larger than a given threshold value such that the total beam-on time during delivery is minimized; (4) the shape rectangularization problems, which are useful in simplifying a complicated continuous dose distribution into a deliverable discrete IM; (5) the coupled path planning problems, which are directly related to dynamic leaf sequencing and single-arc dose painting, an emerging IMRT delivery technique. Our main ideas are to exploit the underlying geometric and combinatorial properties of the problems and transform them into graph problems such as shortest paths, optimal matchings, maximum flows, multicommodity demand flows, or linear programming problems.	cache/3197xk83f5r.txt	txt/3197xk83f5r.txt