An integer linear programming formulation for the minimum cardinality segmentation problem
DOI10.3390/A8040999zbMATH Open1461.90073OpenAlexW2121510931MaRDI QIDQ1736729FDOQ1736729
Authors: 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
Recommendations
- An exact method for the minimum cardinality problem in the treatment planning of intensity-modulated radiotherapy
- Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches
- CP and IP approaches to cancer radiotherapy delivery optimization
- Minimizing the number of apertures in multileaf collimator sequencing with field splitting
- A network approach for segmentation in intensity modulated arc therapy
mixed integer linear programmingmatrix decompositionintensity-modulated radiation therapymultileaf collimatorminimum cardinality segmentation problem
Medical applications (general) (92C50) Programming involving graphs or networks (90C35) Integer programming (90C10)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Mersenne twister
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact algorithms for minimum routing cost trees
- Mathematical optimization in intensity modulated radiation therapy
- Decomposition of integer matrices and multileaf collimator sequencing
- A new algorithm for optimal multileaf collimator field segmentation
- An exact method for the minimum cardinality problem in the treatment planning of intensity-modulated radiotherapy
- Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches
- Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators
- Twisted GFSR generators
- Constrained decompositions of integer matrices and their applications to intensity modulated radiation therapy
- Nonnegative integral subset representations of integer sets
- CP and IP approaches to cancer radiotherapy delivery optimization
- Iterative variable aggregation and disaggregation in IP: an application
- A shortest path-based approach to the multileaf collimator sequencing problem
- Faster optimal algorithms for segment minimization with small maximal value
Cited In (2)
Uses Software
This page was built for publication: An integer linear programming formulation for the minimum cardinality segmentation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736729)
