Iterative variable aggregation and disaggregation in IP: An application

Authors:
Vicky Mak
Affiliations:
School of Information Technology, Burwood Campus, Deakin University, Australia
Venue:
Operations Research Letters
Year:
2007

Citing 8
Cited 1

Aggregation and disaggregation in integer programming problems

Operations Research
Convergence aspects of adaptive clustering in variable aggregation

Computers and Operations Research - Special issue on aggregation and disaggregation in operations research
Localization of the optimal solution and posteriori bounds for aggregation

Computers and Operations Research - Special issue on aggregation and disaggregation in operations research
Minimizing beam-on time in cancer radiation treatment using multileaf collimators

Networks
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy

Networks
Decomposition of integer matrices and multileaf collimator sequencing

Discrete Applied Mathematics
A new algorithm for optimal multileaf collimator field segmentation

Discrete Applied Mathematics
A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint

Discrete Applied Mathematics

CP and IP approaches to cancer radiotherapy delivery optimization

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper, using the Unconstrained Shape Matrix Optimization Problem as a test bed, we investigate various aspects of variable aggregation and disaggregation for a class of integer programs that contains binary expansion. We present theoretical and numerical results, and propose an iterative algorithm for exact solutions.