Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches-Reference-Cited by-同舟云学术

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

Published:2007 Issue: Volume: Page:1-15
ISSN:0302-9743
Container-title:Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
language:
Short-container-title:

Author:

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

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-72397-4_1

Reference17 articles.

1. Ahuja, R.K., Hamacher, H.W.: Linear time network flow algorithm to minimize beam-on-time for unconstrained multileaf collimator problems in cancer radiation therapy. Networks 45(1), 36–41 (2004)

2. Baatar, D.: Matrix decomposition with time and cardinality objectives: Theory, Algorithms and Application to Multileaf collimator sequencing. PhD thesis, University of Kaiserslautern, Germany (2005)

3. Baatar, D., Hamacher, H.W., Ehrgott, M., Woeginger, G.J.: Decomposition of integer matrices and multileaf collimator sequencing. Discrete Applied Mathematics 152(1-3), 6–34 (2005)

4. Lecture Notes in Computer Science;N. Bansal,2006

5. Lecture Notes in Computer Science;R. Becket,2005

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Maximum-throughput mapping of SDFGs on multi-core SoC platforms;Journal of Parallel and Distributed Computing;2013-10

2. Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures;Computers & Operations Research;2013-09

3. Faster optimal algorithms for segment minimization with small maximal value;Discrete Applied Mathematics;2013-02

4. A shortest path-based approach to the multileaf collimator sequencing problem;Discrete Applied Mathematics;2012-01

5. Inter-instance Nogood Learning in Constraint Programming;Lecture Notes in Computer Science;2012