Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches

DOI10.1007/978-3-540-72397-4_1zbMath1214.15021OpenAlexW1692778824MaRDI QIDQ3612403

Peter J. Stuckey, Davaatseren Baatar, Sebastian Brand, Natashia Boland

Publication date: 10 March 2009

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72397-4_1

Mathematics Subject Classification ID

Integer programming (90C10) Biomedical imaging and signal processing (92C55) Matrices of integers (15B36)

Related Items (11)

Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures ⋮ A function approximation approach to the segmentation step in IMRT planning ⋮ Exploiting subproblem dominance in constraint programming ⋮ An integer linear programming formulation for the minimum cardinality segmentation problem ⋮ The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT) ⋮ Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators ⋮ Mathematical optimization in intensity modulated radiation therapy ⋮ Mathematical optimization in intensity modulated radiation therapy ⋮ CP and IP approaches to cancer radiotherapy delivery optimization ⋮ A shortest path-based approach to the multileaf collimator sequencing problem ⋮ A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning

This page was built for publication: Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches