Author:
Simonis Helmut,O’Sullivan Barry
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling problems. Journal of Mathematical and Computer Modelling 17(7), 57–73 (1993)
2. Beldiceanu, N., Bourreau, E., Simonis, H.: A note on perfect square placement, Prob009 in CSPLIB (1999)
3. Beldiceanu, N., Carlsson, M.: Sweep as a generic pruning technique applied to the non-overlapping rectangles constraint. In: Walsh [20], pp. 377–391.
4. Beldiceanu, N., Carlsson, M., Poder, E.: New filtering for the cumulative constraint in the context of non-overlapping. In: CP-AI-OR 2008, Paris (May 2008)
5. Lecture Notes in Computer Science;N. Beldiceanu,2007
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Packing by Scheduling: Using Constraint Programming to Solve a Complex 2D Cutting Stock Problem;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2022
2. Visualizations to Summarize Search Behavior;Lecture Notes in Computer Science;2020
3. Optimal Rectangle Packing: An Absolute Placement Approach;Journal of Artificial Intelligence Research;2013-01-23
4. Weibull-Based Benchmarks for Bin Packing;Lecture Notes in Computer Science;2012