A shortest path-based approach to the multileaf collimator sequencing problem
From MaRDI portal
Publication:765342
DOI10.1016/j.dam.2011.09.008zbMath1235.90125OpenAlexW1998172642MaRDI QIDQ765342
Eoin O'Mahony, Barry O'Sullivan, Hadrien Cambazard
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.09.008
Related Items (6)
New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach ⋮ An integer linear programming formulation for the minimum cardinality segmentation problem ⋮ The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT) ⋮ Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT) ⋮ On explaining integer vectors by few homogeneous segments ⋮ A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning
Cites Work
- Unnamed Item
- Nonnegative integral subset representations of integer sets
- A \texttt{cost-regular} based hybrid column generation approach
- Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators
- On the choice of explicit stabilizing terms in 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
- Simple upper bounds for partition functions
- Stabilized column generation
- Decomposition of integer matrices and multileaf collimator sequencing
- A new algorithm for optimal multileaf collimator field segmentation
- A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint
- 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
- Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning
- Decomposition Principle for Linear Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- Reformulation and Decomposition of Integer Programs
- Hybrid Methods for the Multileaf Collimator Sequencing Problem
- Minimizing Setup and Beam-On Times in Radiation Therapy
- Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- Minimizing beam-on time in cancer radiation treatment using multileaf collimators
- A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy
- Column Generation
- Selected Topics in Column Generation
- Shorter Path Constraints for the Resource Constrained Shortest Path Problem
- Principles and Practice of Constraint Programming – CP 2004
- Mathematical optimization in intensity modulated radiation therapy
This page was built for publication: A shortest path-based approach to the multileaf collimator sequencing problem
