Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures

DOI10.1016/j.cor.2011.07.005zbMath1348.90495OpenAlexW1991731355MaRDI QIDQ336468

Mucahit Cevik, Z. Caner Taşkın

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

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

Related Items (12)

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

Uses Software

• CPLEX

Cites Work

• A function approximation approach to the segmentation step in IMRT planning
• Approximated matrix decomposition for IMRT planning with multileaf collimators
• Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators
• IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
• Intensity modulated radiation therapy treatment plan optimization. With comments and rejoinder
• 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
• Finding the minimum weight IIS cover of an infeasible system of linear inequalities
• Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures
• Integer programming applied to intensity-modulated radiation therapy treatment planning
• A dual of the rectangle-segmentation problem for binary matrices
• Iterative solution methods for beam angle and fluence map optimization in intensity modulated radiation therapy planning
• Decomposition of integer matrices and multileaf collimator sequencing
• A new algorithm for optimal multileaf collimator field segmentation
• Fast Heuristics for the Maximum Feasible Subsystem Problem
• 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
• Combinatorial Benders Cuts for the Minimum Tollbooth Problem
• A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Hybrid Methods for the Multileaf Collimator Sequencing Problem
• A nested benders decomposition approach for telecommunication network planning
• Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Identifying Minimally Infeasible Subsystems of Inequalities
• Analyzing Infeasible Mixed-Integer and Integer Linear Programs
• A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy
• Optimal matrix-segmentation by rectangles

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