An integer linear programming formulation for the minimum cardinality segmentation problem

DOI10.3390/a8040999zbMath1461.90073OpenAlexW2121510931MaRDI QIDQ1736729

Daniele Catanzaro, Céline Engelbeen

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a8040999

zbMATH Keywords

mixed integer linear programmingmatrix decompositionintensity-modulated radiation therapymultileaf collimatorminimum cardinality segmentation problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Medical applications (general) (92C50)

Uses Software

• MersenneTwister

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• CP and IP approaches to cancer radiotherapy delivery optimization
• A shortest path-based approach to the multileaf collimator sequencing problem
• Nonnegative integral subset representations of integer sets
• Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators
• Faster optimal algorithms for segment minimization with small maximal value
• Decomposition of integer matrices and multileaf collimator sequencing
• A new algorithm for optimal multileaf collimator field segmentation
• Iterative variable aggregation and disaggregation in IP: an application
• An Exact Method for the Minimum Cardinality Problem in the Treatment Planning of Intensity-Modulated Radiotherapy
• Constrained decompositions of integer matrices and their applications to intensity modulated radiation therapy
• Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches
• Mersenne twister
• Exact algorithms for minimum routing cost trees
• Twisted GFSR generators
• Mathematical optimization in intensity modulated radiation therapy

This page was built for publication: An integer linear programming formulation for the minimum cardinality segmentation problem