The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence
- Author
- KALINOWSKI, Thomas1
[1] Institut für Mathematik, Universität Rostock, 18051 Rostock, Germany - Conference title
- Optimal Discrete Structures and Algorithms ODSA 2006
- Conference name
- ODSA 2006 Optimal Discrete Structures and Algorithms. Conference (Rostock 2006-09-04)
- Author (monograph)
- BRANDSTÄDT, Andreas (Editor)1 ; ENGEL, Konrad (Editor)2 ; GRONAU, Hans-Dietrich (Editor)2 ; LE, Van Bang (Editor)1
[1] Institut für Informatik, Universität Rostock, 18051 Rostock, Germany
[2] Institut für Mathematik, Universität Rostock, 18051 Rostock, Germany - Source
Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2089-2104, 16 p ; ref : 18 ref
- CODEN
- DAMADU
- ISSN
- 0166-218X
- Scientific domain
- Control theory, operational research; Computer science; Mathematics
- Publisher
- Elsevier, Kidlington
- Publication country
- United Kingdom
- Document type
- Conference Paper
- Language
- English
- Author keyword
- IMRT Intensity modulation Leafsequencing Multileaf collimator Radiation therapy optimization
- Keyword (fr)
- Algorithme optimal Combinatoire Complexité Distribution Décomposition matricielle Faisceau Fonction répartition Forme Heuristique Informatique théorique Matrice Modulation Méthode décomposition Méthode optimisation Nombre entier Optimisation Planification Segmentation Temps polynomial 49XX 65Kxx 68Wxx
- Keyword (en)
- Optimal algorithm Combinatorics Complexity Distribution Matrix decomposition Beams Distribution function Shape Heuristics Computer theory Matrices Modulation Decomposition method Optimization method Integer Optimization Planning Segmentation Polynomial time
- Keyword (es)
- Algoritmo óptimo Combinatoria Complejidad Distribución Descomposición matricial Función distribución Forma Heurística Informática teórica Modulación Método descomposición Método optimización Entero Optimización Planificación Segmentación Tiempo polinomial
- Classification
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02B Combinatorics. Ordered structures / 001A02B01 Combinatorics
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02E Mathematical analysis / 001A02E18 Calculus of variations and optimal control
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02I Numerical analysis. Scientific computation / 001A02I01 Numerical analysis / 001A02I01P Numerical methods in mathematical programming, optimization and calculus of variations
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics
- Discipline
- Computer science : theoretical automation and systems Mathematics
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 21749773
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1016/j.dam.2008.06.027 
https://dx.doi.org/10.1016/j.dam.2008.06.027
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.dam.2008.06.027\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:154:\"The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence\";s:9:\"\u0000*\u0000jtitle\";s:28:\"Discrete applied mathematics\";s:9:\"\u0000*\u0000stitle\";s:19:\"Discrete appl. math\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:3:\"157\";s:8:\"\u0000*\u0000issue\";s:1:\"9\";s:8:\"\u0000*\u0000spage\";s:4:\"2089\";s:8:\"\u0000*\u0000epage\";s:4:\"2104\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0166-218X\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"KALINOWSKI\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Thomas\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"DAMADU\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:52:\"Optimal Discrete Structures and Algorithms ODSA 2006\";s:8:\"\u0000*\u0000title\";s:154:\"The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence\";s:8:\"\u0000*\u0000place\";s:10:\"Kidlington\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.dam.2008.06.027\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:154:\"The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence\";s:9:\"\u0000*\u0000jtitle\";s:28:\"Discrete applied mathematics\";s:9:\"\u0000*\u0000stitle\";s:19:\"Discrete appl. math\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:3:\"157\";s:8:\"\u0000*\u0000issue\";s:1:\"9\";s:8:\"\u0000*\u0000spage\";s:4:\"2089\";s:8:\"\u0000*\u0000epage\";s:4:\"2104\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0166-218X\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"KALINOWSKI\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Thomas\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"DAMADU\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:52:\"Optimal Discrete Structures and Algorithms ODSA 2006\";s:8:\"\u0000*\u0000title\";s:154:\"The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence\";s:8:\"\u0000*\u0000place\";s:10:\"Kidlington\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.dam.2008.06.027\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.dam.2008.06.027\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:154:\"The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence\";s:9:\"\u0000*\u0000jtitle\";s:28:\"Discrete applied mathematics\";s:9:\"\u0000*\u0000stitle\";s:19:\"Discrete appl. math\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:3:\"157\";s:8:\"\u0000*\u0000issue\";s:1:\"9\";s:8:\"\u0000*\u0000spage\";s:4:\"2089\";s:8:\"\u0000*\u0000epage\";s:4:\"2104\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0166-218X\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"KALINOWSKI\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Thomas\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"DAMADU\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:52:\"Optimal Discrete Structures and Algorithms ODSA 2006\";s:8:\"\u0000*\u0000title\";s:154:\"The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence\";s:8:\"\u0000*\u0000place\";s:10:\"Kidlington\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.dam.2008.06.027\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:154:\"The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence\";s:9:\"\u0000*\u0000jtitle\";s:28:\"Discrete applied mathematics\";s:9:\"\u0000*\u0000stitle\";s:19:\"Discrete appl. math\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:3:\"157\";s:8:\"\u0000*\u0000issue\";s:1:\"9\";s:8:\"\u0000*\u0000spage\";s:4:\"2089\";s:8:\"\u0000*\u0000epage\";s:4:\"2104\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0166-218X\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"KALINOWSKI\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Thomas\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"DAMADU\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:52:\"Optimal Discrete Structures and Algorithms ODSA 2006\";s:8:\"\u0000*\u0000title\";s:154:\"The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence\";s:8:\"\u0000*\u0000place\";s:10:\"Kidlington\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.dam.2008.06.027\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:154:\"The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence\";s:9:\"\u0000*\u0000jtitle\";s:28:\"Discrete applied mathematics\";s:9:\"\u0000*\u0000stitle\";s:19:\"Discrete appl. math\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:3:\"157\";s:8:\"\u0000*\u0000issue\";s:1:\"9\";s:8:\"\u0000*\u0000spage\";s:4:\"2089\";s:8:\"\u0000*\u0000epage\";s:4:\"2104\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0166-218X\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"KALINOWSKI\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Thomas\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"DAMADU\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:52:\"Optimal Discrete Structures and Algorithms ODSA 2006\";s:8:\"\u0000*\u0000title\";s:154:\"The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence\";s:8:\"\u0000*\u0000place\";s:10:\"Kidlington\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
