Minimum-Support Solutions for Radiotherapy Planning
Identifieur interne : 002607 ( Istex/Corpus ); précédent : 002606; suivant : 002608Minimum-Support Solutions for Radiotherapy Planning
Auteurs : Stephen C. Billups ; Janine M. KennedySource :
- Annals of Operations Research [ 0254-5330 ] ; 2003-03-01.
English descriptors
- KwdEn :
Abstract
Abstract: Computer-generated plans for radiation treatment sometimes involve an unnecessarily large number of gantry angles. Such plans are time consuming and expensive to administer because each distinct angle causes a delay while the gantry is repositioned. To address this issue, we consider an optimization model that generates minimum-support solutions to the treatment planning problem – that is, solutions involving a minimum number of gantry angles. This model is a polyhedral concave program, which is solved using a successive linearization algorithm based on work by Mangasarian [10].
Url:
DOI: 10.1023/A:1022946926589
Links to Exploration step
ISTEX:A1943B6860AC8E9288C1DA9729727EE1EDB80605Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Minimum-Support Solutions for Radiotherapy Planning</title><author><name sortKey="Billups, Stephen C" sort="Billups, Stephen C" uniqKey="Billups S" first="Stephen C." last="Billups">Stephen C. Billups</name><affiliation><mods:affiliation>Department of Mathematics, University of Colorado, 80217-3364, Denver, CO, USA</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: sbillups@carbon.cudenver.edu</mods:affiliation></affiliation></author><author><name sortKey="Kennedy, Janine M" sort="Kennedy, Janine M" uniqKey="Kennedy J" first="Janine M." last="Kennedy">Janine M. Kennedy</name><affiliation><mods:affiliation>Department of Mathematics, University of Colorado, 80217-3364, Denver, CO, USA</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: jmkenned@math.cudenver.edu</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:A1943B6860AC8E9288C1DA9729727EE1EDB80605</idno><date when="2003" year="2003">2003</date><idno type="doi">10.1023/A:1022946926589</idno><idno type="url">https://api.istex.fr/ark:/67375/VQC-7Z7TZ25W-Q/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002607</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002607</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Minimum-Support Solutions for Radiotherapy Planning</title><author><name sortKey="Billups, Stephen C" sort="Billups, Stephen C" uniqKey="Billups S" first="Stephen C." last="Billups">Stephen C. Billups</name><affiliation><mods:affiliation>Department of Mathematics, University of Colorado, 80217-3364, Denver, CO, USA</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: sbillups@carbon.cudenver.edu</mods:affiliation></affiliation></author><author><name sortKey="Kennedy, Janine M" sort="Kennedy, Janine M" uniqKey="Kennedy J" first="Janine M." last="Kennedy">Janine M. Kennedy</name><affiliation><mods:affiliation>Department of Mathematics, University of Colorado, 80217-3364, Denver, CO, USA</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: jmkenned@math.cudenver.edu</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Annals of Operations Research</title><title level="j" type="abbrev">Annals of Operations Research</title><idno type="ISSN">0254-5330</idno><idno type="eISSN">1572-9338</idno><imprint><publisher>Kluwer Academic Publishers</publisher><pubPlace>Dordrecht</pubPlace><date type="published" when="2003-03-01">2003-03-01</date><biblScope unit="volume">119</biblScope><biblScope unit="issue">1-4</biblScope><biblScope unit="page" from="229">229</biblScope><biblScope unit="page" to="245">245</biblScope></imprint><idno type="ISSN">0254-5330</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0254-5330</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>linear programming</term><term>minimum-support solution</term><term>polyhedral concave program</term><term>radiotherapy planning</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Computer-generated plans for radiation treatment sometimes involve an unnecessarily large number of gantry angles. Such plans are time consuming and expensive to administer because each distinct angle causes a delay while the gantry is repositioned. To address this issue, we consider an optimization model that generates minimum-support solutions to the treatment planning problem – that is, solutions involving a minimum number of gantry angles. This model is a polyhedral concave program, which is solved using a successive linearization algorithm based on work by Mangasarian [10].</div></front></TEI><istex><corpusName>springer-journals</corpusName><author><json:item><name>Stephen C. Billups</name><affiliations><json:string>Department of Mathematics, University of Colorado, 80217-3364, Denver, CO, USA</json:string><json:string>E-mail: sbillups@carbon.cudenver.edu</json:string></affiliations></json:item><json:item><name>Janine M. Kennedy</name><affiliations><json:string>Department of Mathematics, University of Colorado, 80217-3364, Denver, CO, USA</json:string><json:string>E-mail: jmkenned@math.cudenver.edu</json:string></affiliations></json:item></author><subject><json:item><lang><json:string>eng</json:string></lang><value>radiotherapy planning</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>minimum-support solution</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>polyhedral concave program</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>linear programming</value></json:item></subject><articleId><json:string>5115488</json:string><json:string>Art13</json:string></articleId><arkIstex>ark:/67375/VQC-7Z7TZ25W-Q</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: Computer-generated plans for radiation treatment sometimes involve an unnecessarily large number of gantry angles. Such plans are time consuming and expensive to administer because each distinct angle causes a delay while the gantry is repositioned. To address this issue, we consider an optimization model that generates minimum-support solutions to the treatment planning problem – that is, solutions involving a minimum number of gantry angles. This model is a polyhedral concave program, which is solved using a successive linearization algorithm based on work by Mangasarian [10].</abstract><qualityIndicators><score>8.032</score><pdfWordCount>5815</pdfWordCount><pdfCharCount>28660</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>17</pdfPageCount><pdfPageSize>595 x 842 pts (A4)</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>86</abstractWordCount><abstractCharCount>595</abstractCharCount><keywordCount>4</keywordCount></qualityIndicators><title>Minimum-Support Solutions for Radiotherapy Planning</title><genre><json:string>research-article</json:string></genre><host><title>Annals of Operations Research</title><language><json:string>unknown</json:string></language><publicationDate>2003</publicationDate><copyrightDate>2003</copyrightDate><issn><json:string>0254-5330</json:string></issn><eissn><json:string>1572-9338</json:string></eissn><journalId><json:string>10479</json:string></journalId><volume>119</volume><issue>1-4</issue><pages><first>229</first><last>245</last></pages><genre><json:string>journal</json:string></genre><subject><json:item><value>Theory of Computation</value></json:item><json:item><value>Combinatorics</value></json:item><json:item><value>Operation Research/Decision Theory</value></json:item></subject></host><ark><json:string>ark:/67375/VQC-7Z7TZ25W-Q</json:string></ark><publicationDate>2003</publicationDate><copyrightDate>2003</copyrightDate><doi><json:string>10.1023/A:1022946926589</json:string></doi><id>A1943B6860AC8E9288C1DA9729727EE1EDB80605</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/ark:/67375/VQC-7Z7TZ25W-Q/fulltext.pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/ark:/67375/VQC-7Z7TZ25W-Q/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/VQC-7Z7TZ25W-Q/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Minimum-Support Solutions for Radiotherapy Planning</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher scheme="https://scientific-publisher.data.istex.fr">Kluwer Academic Publishers</publisher><pubPlace>Dordrecht</pubPlace><availability><licence><p>Kluwer Academic Publishers, 2003</p></licence><p scheme="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-3XSW68JL-F">springer</p></availability><date>2003</date></publicationStmt><notesStmt><note type="research-article" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</note><note type="journal" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0GLKJH51-B">journal</note></notesStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Minimum-Support Solutions for Radiotherapy Planning</title><author xml:id="author-0000"><persName><forename type="first">Stephen</forename><surname>Billups</surname></persName><email>sbillups@carbon.cudenver.edu</email><affiliation>Department of Mathematics, University of Colorado, 80217-3364, Denver, CO, USA</affiliation></author><author xml:id="author-0001"><persName><forename type="first">Janine</forename><surname>Kennedy</surname></persName><email>jmkenned@math.cudenver.edu</email><affiliation>Department of Mathematics, University of Colorado, 80217-3364, Denver, CO, USA</affiliation></author><idno type="istex">A1943B6860AC8E9288C1DA9729727EE1EDB80605</idno><idno type="ark">ark:/67375/VQC-7Z7TZ25W-Q</idno><idno type="DOI">10.1023/A:1022946926589</idno><idno type="article-id">5115488</idno><idno type="article-id">Art13</idno></analytic><monogr><title level="j">Annals of Operations Research</title><title level="j" type="abbrev">Annals of Operations Research</title><idno type="pISSN">0254-5330</idno><idno type="eISSN">1572-9338</idno><idno type="journal-ID">true</idno><idno type="issue-article-count">16</idno><idno type="volume-issue-count">4</idno><imprint><publisher>Kluwer Academic Publishers</publisher><pubPlace>Dordrecht</pubPlace><date type="published" when="2003-03-01"></date><biblScope unit="volume">119</biblScope><biblScope unit="issue">1-4</biblScope><biblScope unit="page" from="229">229</biblScope><biblScope unit="page" to="245">245</biblScope></imprint></monogr></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2003</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: Computer-generated plans for radiation treatment sometimes involve an unnecessarily large number of gantry angles. Such plans are time consuming and expensive to administer because each distinct angle causes a delay while the gantry is repositioned. To address this issue, we consider an optimization model that generates minimum-support solutions to the treatment planning problem – that is, solutions involving a minimum number of gantry angles. This model is a polyhedral concave program, which is solved using a successive linearization algorithm based on work by Mangasarian [10].</p></abstract><textClass xml:lang="en"><keywords scheme="keyword"><list><item><term>radiotherapy planning</term></item><item><term>minimum-support solution</term></item><item><term>polyhedral concave program</term></item><item><term>linear programming</term></item></list></keywords></textClass><textClass><keywords scheme="Journal Subject"><list><head>Economics / Management Science</head><item><term>Theory of Computation</term></item><item><term>Combinatorics</term></item><item><term>Operation Research/Decision Theory</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2003-03-01">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/ark:/67375/VQC-7Z7TZ25W-Q/fulltext.txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="corpus springer-journals not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Kluwer Academic Publishers</PublisherName><PublisherLocation>Dordrecht</PublisherLocation></PublisherInfo><Journal><JournalInfo JournalProductType="ArchiveJournal" NumberingStyle="Unnumbered"><JournalID>10479</JournalID><JournalPrintISSN>0254-5330</JournalPrintISSN><JournalElectronicISSN>1572-9338</JournalElectronicISSN><JournalTitle>Annals of Operations Research</JournalTitle><JournalAbbreviatedTitle>Annals of Operations Research</JournalAbbreviatedTitle><JournalSubjectGroup><JournalSubject Type="Primary">Economics / Management Science</JournalSubject><JournalSubject Type="Secondary">Theory of Computation</JournalSubject><JournalSubject Type="Secondary">Combinatorics</JournalSubject><JournalSubject Type="Secondary">Operation Research/Decision Theory</JournalSubject></JournalSubjectGroup></JournalInfo><Volume><VolumeInfo VolumeType="Regular" TocLevels="0"><VolumeIDStart>119</VolumeIDStart><VolumeIDEnd>119</VolumeIDEnd><VolumeIssueCount>4</VolumeIssueCount></VolumeInfo><Issue IssueType="Combined"><IssueInfo TocLevels="0"><IssueIDStart>1</IssueIDStart><IssueIDEnd>4</IssueIDEnd><IssueArticleCount>16</IssueArticleCount><IssueHistory><CoverDate><Year>2003</Year><Month>3</Month></CoverDate></IssueHistory><IssueCopyright><CopyrightHolderName>Kluwer Academic Publishers</CopyrightHolderName><CopyrightYear>2003</CopyrightYear></IssueCopyright></IssueInfo><Article ID="Art13"><ArticleInfo Language="En" ArticleType="OriginalPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ArticleID>5115488</ArticleID><ArticleDOI>10.1023/A:1022946926589</ArticleDOI><ArticleSequenceNumber>13</ArticleSequenceNumber><ArticleTitle Language="En">Minimum-Support Solutions for Radiotherapy Planning</ArticleTitle><ArticleFirstPage>229</ArticleFirstPage><ArticleLastPage>245</ArticleLastPage><ArticleHistory><RegistrationDate><Year>2004</Year><Month>10</Month><Day>5</Day></RegistrationDate></ArticleHistory><ArticleCopyright><CopyrightHolderName>Kluwer Academic Publishers</CopyrightHolderName><CopyrightYear>2003</CopyrightYear></ArticleCopyright><ArticleGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ArticleGrants><ArticleContext><JournalID>10479</JournalID><VolumeIDStart>119</VolumeIDStart><VolumeIDEnd>119</VolumeIDEnd><IssueIDStart>1</IssueIDStart><IssueIDEnd>4</IssueIDEnd></ArticleContext></ArticleInfo><ArticleHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Stephen</GivenName><GivenName>C.</GivenName><FamilyName>Billups</FamilyName></AuthorName><Contact><Email>sbillups@carbon.cudenver.edu</Email></Contact></Author><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Janine</GivenName><GivenName>M.</GivenName><FamilyName>Kennedy</FamilyName></AuthorName><Contact><Email>jmkenned@math.cudenver.edu</Email></Contact></Author><Affiliation ID="Aff1"><OrgDivision>Department of Mathematics</OrgDivision><OrgName>University of Colorado</OrgName><OrgAddress><City>Denver</City><State>CO</State><Postcode>80217-3364</Postcode><Country>USA</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>Computer-generated plans for radiation treatment sometimes involve an unnecessarily large number of gantry angles. Such plans are time consuming and expensive to administer because each distinct angle causes a delay while the gantry is repositioned. To address this issue, we consider an optimization model that generates minimum-support solutions to the treatment planning problem – that is, solutions involving a minimum number of gantry angles. This model is a polyhedral concave program, which is solved using a successive linearization algorithm based on work by Mangasarian [10].</Para></Abstract><KeywordGroup Language="En"><Keyword>radiotherapy planning</Keyword><Keyword>minimum-support solution</Keyword><Keyword>polyhedral concave program</Keyword><Keyword>linear programming</Keyword></KeywordGroup></ArticleHeader><NoBody></NoBody></Article></Issue></Volume></Journal></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Minimum-Support Solutions for Radiotherapy Planning</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Minimum-Support Solutions for Radiotherapy Planning</title></titleInfo><name type="personal"><namePart type="given">Stephen</namePart><namePart type="given">C.</namePart><namePart type="family">Billups</namePart><affiliation>Department of Mathematics, University of Colorado, 80217-3364, Denver, CO, USA</affiliation><affiliation>E-mail: sbillups@carbon.cudenver.edu</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Janine</namePart><namePart type="given">M.</namePart><namePart type="family">Kennedy</namePart><affiliation>Department of Mathematics, University of Colorado, 80217-3364, Denver, CO, USA</affiliation><affiliation>E-mail: jmkenned@math.cudenver.edu</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</genre><originInfo><publisher>Kluwer Academic Publishers</publisher><place><placeTerm type="text">Dordrecht</placeTerm></place><dateIssued encoding="w3cdtf">2003-03-01</dateIssued><copyrightDate encoding="w3cdtf">2003</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract lang="en">Abstract: Computer-generated plans for radiation treatment sometimes involve an unnecessarily large number of gantry angles. Such plans are time consuming and expensive to administer because each distinct angle causes a delay while the gantry is repositioned. To address this issue, we consider an optimization model that generates minimum-support solutions to the treatment planning problem – that is, solutions involving a minimum number of gantry angles. This model is a polyhedral concave program, which is solved using a successive linearization algorithm based on work by Mangasarian [10].</abstract><subject lang="en"><topic>radiotherapy planning</topic><topic>minimum-support solution</topic><topic>polyhedral concave program</topic><topic>linear programming</topic></subject><relatedItem type="host"><titleInfo><title>Annals of Operations Research</title></titleInfo><titleInfo type="abbreviated"><title>Annals of Operations Research</title></titleInfo><genre type="journal" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0GLKJH51-B">journal</genre><originInfo><publisher>Springer</publisher><dateIssued encoding="w3cdtf">2003-03-01</dateIssued><copyrightDate encoding="w3cdtf">2003</copyrightDate></originInfo><subject><genre>Economics / Management Science</genre><topic>Theory of Computation</topic><topic>Combinatorics</topic><topic>Operation Research/Decision Theory</topic></subject><identifier type="ISSN">0254-5330</identifier><identifier type="eISSN">1572-9338</identifier><identifier type="JournalID">10479</identifier><identifier type="IssueArticleCount">16</identifier><identifier type="VolumeIssueCount">4</identifier><part><date>2003</date><detail type="volume"><number>119</number><caption>vol.</caption></detail><detail type="issue"><number>1-4</number><caption>no.</caption></detail><extent unit="pages"><start>229</start><end>245</end></extent></part><recordInfo><recordOrigin>Kluwer Academic Publishers, 2003</recordOrigin></recordInfo></relatedItem><identifier type="istex">A1943B6860AC8E9288C1DA9729727EE1EDB80605</identifier><identifier type="ark">ark:/67375/VQC-7Z7TZ25W-Q</identifier><identifier type="DOI">10.1023/A:1022946926589</identifier><identifier type="ArticleID">5115488</identifier><identifier type="ArticleID">Art13</identifier><accessCondition type="use and reproduction" contentType="copyright">Kluwer Academic Publishers, 2003</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-3XSW68JL-F">springer</recordContentSource><recordOrigin>Kluwer Academic Publishers, 2003</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/VQC-7Z7TZ25W-Q/record.json</uri></json:item></metadata><serie></serie></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002607 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 002607 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:A1943B6860AC8E9288C1DA9729727EE1EDB80605
|texte= Minimum-Support Solutions for Radiotherapy Planning
}}
| This area was generated with Dilib version V0.6.33. |  |