Geoffrey Chu, Peter J. Stuckey. Minimizing the Maximum Number of Open Stacks by Customer Search. In Ian P. Gent, editor, Principles and Practice of Constraint Programming - CP 2009, 15th International Conference, CP 2009, Lisbon, Portugal, September 20-24, 2009, Proceedings. Volume 5732 of Lecture Notes in Computer Science, pages 242-257, Springer, 2009. [doi]
@inproceedings{ChuS09, title = {Minimizing the Maximum Number of Open Stacks by Customer Search}, author = {Geoffrey Chu and Peter J. Stuckey}, year = {2009}, doi = {10.1007/978-3-642-04244-7_21}, url = {http://dx.doi.org/10.1007/978-3-642-04244-7_21}, tags = {source-to-source, search, open-source}, researchr = {https://researchr.org/publication/ChuS09}, cites = {0}, citedby = {0}, pages = {242-257}, booktitle = {Principles and Practice of Constraint Programming - CP 2009, 15th International Conference, CP 2009, Lisbon, Portugal, September 20-24, 2009, Proceedings}, editor = {Ian P. Gent}, volume = {5732}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-04243-0}, }