A shortest path-based approach to the multileaf collimator sequencing problem
From MaRDI portal
Publication:765342
Recommendations
- Hybrid methods for the multileaf collimator sequencing problem
- Decomposition of integer matrices and multileaf collimator sequencing
- A new sequential extraction heuristic for optimizing the delivery of cancer radiation treatment using multileaf collimators
- Minimizing beam-on time in cancer radiation treatment using multileaf collimators
- CP and IP approaches to cancer radiotherapy delivery optimization
Cites work
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- A Linear Programming Approach to the Cutting-Stock Problem
- A \texttt{cost-regular} based hybrid column generation approach
- A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint
- A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy
- 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
- Binary matrix decompositions without tongue-and-groove underdosage for radiation therapy planning
- Column Generation
- Constrained decompositions of integer matrices and their applications to intensity modulated radiation therapy
- Decomposition Principle for Linear Programs
- Decomposition of integer matrices and multileaf collimator sequencing
- Hybrid methods for the multileaf collimator sequencing problem
- Mathematical optimization in intensity modulated radiation therapy
- Minimizing Setup and Beam-On Times in Radiation Therapy
- Minimizing beam-on time in cancer radiation treatment using multileaf collimators
- 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
- Nonnegative integral subset representations of integer sets
- On the choice of explicit stabilizing terms in column generation
- Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning
- Principles and Practice of Constraint Programming – CP 2004
- Reformulation and decomposition of integer programs
- Selected Topics in Column Generation
- Shorter Path Constraints for the Resource Constrained Shortest Path Problem
- Simple upper bounds for partition functions
- Stabilized column generation
- The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence
Cited in
(10)- On explaining integer vectors by few homogeneous segments
- A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning
- Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT)
- New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach
- The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT)
- Hybrid methods for the multileaf collimator sequencing problem
- Minimizing the number of apertures in multileaf collimator sequencing with field splitting
- The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence
- An integer linear programming formulation for the minimum cardinality segmentation problem
- Fast coupled path planning: from pseudo-polynomial to polynomial
This page was built for publication: A shortest path-based approach to the multileaf collimator sequencing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765342)
