In this paper, we consider the problem of decomposing an integer matrix into a weighted sum of binary matrices that have the strict consecutive ones property. This problem is motivated by an application in cancer radiotherapy planning, namely the sequencing of multileaf collimators to realize a given intensity matrix. In addition, we also mention another application in the design of public transportation. We are interested in two versions of the problem, minimizing the sum of the coefficients in the decomposition (decomposition time) and minimizing the number of matrices used in the decomposition (decomposition cardinality). We present polynomial time algorithms for unconstrained and constrained versions of the decomposition time problem and prove that the (unconstrained) decomposition cardinality problem is strongly NP-hard. For the decomposition cardinality problem, some polynomially solvable special cases are considered and heuristics are proposed for the general case.
We investigate two versions of multiple objective m1rnmum spanning tree problems defined on a network with vectorial weights. First, we want to minimize the maximum of Q linear objective functions taken over the set of all spanning trees (max linear spanning tree problem ML-ST). Secondly, we look for efficient spanning trees (multi criteria spanning tree problem MC-ST) .Problem ML-ST is shown to be NP-complete. An exact algorithm which is based on ranking is presented . The procedure can also be used as an approximation scheme. For solving the bicriterion MC-ST, which in the worst case may have an exponential number of efficient trees, a two-phase procedure is presented. Based on the computation of extremal efficient spanning trees we use neighbourhood search to determine a sequence of solutions with the property that the distance between two consecutive solutions is less than a given accuracy.
In this article the modulation of intensity matrices arising in cancer radiation therapy using multileaf collimators (MLC) is investigated. It is shown that the problem is equivalent to decomposing a given integer matrix into a positive linear combination of (0, 1) matrices. These matrices, called shape matrices, must have the strict consecutive‐1‐property, together with another property derived from the technological restrictions of the MLC equipment. Various decompositions can be evaluated by their beam‐on time (time during which radiation is applied to the patient) or the treatment time (beam‐on time plus time for setups). We focus on the former, and develop a nonlinear mixed‐integer programming formulation of the problem. This formulation can be decomposed to yield a column generation formulation: a linear program with a large number of variables that can be priced by solving a subproblem. We then develop a network model in which paths in the network correspond to feasible shape matrices. As a consequence, we deduce that the column generation subproblem can be solved as a shortest path problem. Furthermore, we are able to develop two alternative models of the problem as side‐constrained network flow formulations, and so obtain our main theoretical result that the problem is solvable in polynomial time. Finally, a numerical comparison of our exact solutions with those of well‐known heuristic methods shows that the beam‐on time can be reduced by a considerable margin. © 2004 Wiley Periodicals, Inc.
The design of an intensity modulated radiotherapy treatment includes the selection of beam angles (geometry problem), the computation of an intensity map for each selected beam angle (intensity problem), and finding a sequence of configurations of a multileaf collimator to deliver the treatment (realization problem). Until the end of the last century research on radiotherapy treatment design has been published almost exclusively in the medical physics literature. However, since then, the attention of researchers in mathematical optimization has been drawn to the area and important progress has been made. In this paper we survey the use of optimization models, methods, and theories in intensity modulated radiotherapy treatment design. This is an updated version of the paper that appeared in 4OR, 6(3), 199-262 (2008).
The design of an intensity modulated radiotherapy treatment includes the selection of beam angles (geometry problem), the computation of an intensity map for each selected beam angle (intensity problem), and finding a sequence of configurations of a multileaf collimator to deliver the treatment (realization problem). Until the end of the last century research on radiotherapy treatment design has been published almost exclusively in the medical physics literature. However, since then, the attention of researchers in mathematical optimization has been drawn to the area and important progress has been made. In this paper we survey the use of optimization models, methods, and theories in intensity modulated radiotherapy treatment design.H.W. Hamacher and Ç.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.