Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures

DOI10.1016/J.COR.2011.07.005MaRDI QIDQ336468zbMATHOpenAlexFDO

Authors Z. Caner Taşkın, Mucahit Cevik

Publication date 10 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2011.07.005

zbMATH Keywords

mixed-integer programmingIMRTcombinatorial Benders decompositionmatrix segmentation by rectangles

Mathematics Subject Classification ID

Medical applications (general) (92C50) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Mixed integer programming (90C11)

Recommendations

• Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures
• Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning
• Minimizing the number of apertures in multileaf collimator sequencing with field splitting
• Combinatorial optimization for an improved transition from fluence optimization to fluence delivery in IMRT treatment planning
• A Column Generation Approach to Radiation Therapy Treatment Planning Using Aperture Modulation

Cites work

• A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems
• A dual of the rectangle-segmentation problem for binary matrices
• A function approximation approach to the segmentation step in IMRT planning
• A nested Benders decomposition approach for telecommunication network planning
• 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
• Analyzing Infeasible Mixed-Integer and Integer Linear Programs
• Approximated matrix decomposition for IMRT planning with multileaf collimators
• Combinatorial Benders cuts for the minimum tollbooth problem
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Decomposition of integer matrices and multileaf collimator sequencing
• Fast heuristics for the maximum feasible subsystem problem
• Finding the minimum weight IIS cover of an infeasible system of linear inequalities
• Hybrid methods for the multileaf collimator sequencing problem
• IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
• Identifying Minimally Infeasible Subsystems of Inequalities
• Integer programming applied to intensity-modulated radiation therapy treatment planning
• Intensity modulated radiation therapy treatment plan optimization. With comments and rejoinder
• Iterative solution methods for beam angle and fluence map optimization in intensity modulated radiation therapy planning
• 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
• Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures
• Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning
• Optimal matrix-segmentation by rectangles
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method

Cited in

(15)

• Multistage stochastic fractionated intensity modulated radiation therapy planning
• Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures
• Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach
• The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT)
• The Benders decomposition algorithm: a literature review
• Combinatorial Benders cuts for assembly line balancing problems with setups
• Combinatorial Benders decomposition for the operational aircraft maintenance routing problem
• The multiple multidimensional knapsack with family-split penalties
• A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
• Decomposition-based algorithms for the crew scheduling and routing problem in road restoration
• An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
• Exact solution algorithms for the maximum flow problem with additional conflict constraints
• Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem
• Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles
• The multi-period multi-trip container drayage problem with release and due dates

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336468)