A shortest path-based approach to the multileaf collimator sequencing problem

Cites Work

A Linear Programming Approach to the Cutting-Stock Problem
A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
Selected Topics in Column Generation
Stabilized column generation
Principles and Practice of Constraint Programming – CP 2004
A \texttt{cost-regular} based hybrid column generation approach
Decomposition Principle for Linear Programs
Column Generation
Reformulation and Decomposition of Integer Programs
Mathematical optimization in intensity modulated radiation therapy
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
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
Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning
Hybrid Methods for the Multileaf Collimator Sequencing Problem
Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches
A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy
Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators
A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint
Constrained decompositions of integer matrices and their applications to intensity modulated radiation therapy
Minimizing beam-on time in cancer radiation treatment using multileaf collimators
Nonnegative integral subset representations of integer sets
Simple upper bounds for partition functions
Minimizing Setup and Beam-On Times in Radiation Therapy
Binary matrix decompositions without tongue-and-groove underdosage for radiation therapy planning
Shorter Path Constraints for the Resource Constrained Shortest Path Problem

Cited In (8)

The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT)
An integer linear programming formulation for the minimum cardinality segmentation problem
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
A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning
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
On explaining integer vectors by few homogeneous segments

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)