var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=kylebooth.org%2Fpubs.bib&jsonp=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=kylebooth.org%2Fpubs.bib&jsonp=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=kylebooth.org%2Fpubs.bib&jsonp=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2023\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Constraint programming models for depth-optimal qubit assignment and SWAP-based routing.\n \n \n \n \n\n\n \n Booth, K. E. C.\n\n\n \n\n\n\n In Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP2023), pages In press, 2023. \n \n\n\n\n
\n\n\n\n \n \n \"Constraint link\n  \n \n \n \"Constraint paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{booth2023qubitrouting, \n\ttitle\t     = {Constraint programming models for depth-optimal qubit assignment and SWAP-based routing},\n        author       = {Booth, Kyle E. C.},\n        year         = 2023,\n\tbooktitle    = {Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP2023)},\n\tpages        = {In press},\n        url_link     = {https://arxiv.org/abs/2306.08629},\n        url_paper    = {https://arxiv.org/pdf/2306.08629.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Quantum-accelerated constraint programming.\n \n \n \n \n\n\n \n Booth, K. E. C.; O'Gorman, B.; Marshall, J.; Hadfield, S.; and Rieffel, E.\n\n\n \n\n\n\n Quantum, 5: 550. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"Quantum-accelerated link\n  \n \n \n \"Quantum-accelerated paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 14 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{booth2021quantumcp,\n\ttitle        = {Quantum-accelerated constraint programming},\n\tauthor       = {Booth, Kyle E. C. and O'Gorman, Bryan and Marshall, Jeffrey and Hadfield, Stuart and Rieffel, Eleanor},\n\tyear         = 2021,\n\tjournal      = {Quantum},\n\tvolume       = 5,\n\tpages        = 550,\n\turl_link     = {https://quantum-journal.org/papers/q-2021-09-28-550/},\n\turl_paper    = {https://arxiv.org/pdf/2103.04502.pdf}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Constraint programming approaches to electric vehicle and robot routing problems.\n \n \n \n \n\n\n \n Booth, K. E. C.\n\n\n \n\n\n\n University of Toronto. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"Constraint link\n  \n \n \n \"Constraint paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 12 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{booth2021thesis,\n\ttitle        = {Constraint programming approaches to electric vehicle and robot routing problems},\n\tauthor       = {Booth, Kyle E. C.},\n\tyear         = 2021,\n\tjournal      = {University of Toronto},\n\turl_link     = {https://tspace.library.utoronto.ca/handle/1807/106297},\n\turl_paper    = {https://tspace.library.utoronto.ca/bitstream/1807/106297/2/Booth_Kyle_Ewart%20Coventry_202106_PhD_thesis.pdf}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Quantum-accelerated global constraint filtering.\n \n \n \n \n\n\n \n Booth, K. E. C.; O'Gorman, B.; Marshall, J.; Hadfield, S.; and Rieffel, E.\n\n\n \n\n\n\n In Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP2020), pages 72–89, 2020. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Quantum-accelerated link\n  \n \n \n \"Quantum-accelerated paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 27 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{booth2020cp,\n\ttitle        = {Quantum-accelerated global constraint filtering},\n\tauthor       = {Booth, Kyle E. C. and O'Gorman, Bryan and Marshall, Jeffrey and Hadfield, Stuart and Rieffel, Eleanor},\n\tyear         = 2020,\n\tbooktitle    = {Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP2020)},\n\tpages        = {72--89},\n\torganization = {Springer},\n\turl_link     = {https://ntrs.nasa.gov/citations/20205003667},\n\turl_paper    = {https://ntrs.nasa.gov/api/citations/20205003667/downloads/Booth-CP-129.pdf}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Target search on road networks with range-constrained UAVs and ground-based mobile recharging vehicles.\n \n \n \n \n\n\n \n Booth, K. E. C.; Piacentini, C.; Bernardini, S.; and Beck, J. C.\n\n\n \n\n\n\n IEEE Robotics and Automation Letters, 5(4): 6702–6709. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"Target link\n  \n \n \n \"Target paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 14 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{booth2020ral,\n\ttitle        = {Target search on road networks with range-constrained UAVs and ground-based mobile recharging vehicles},\n\tauthor       = {Booth, Kyle E. C. and Piacentini, Chiara and Bernardini, Sara and Beck, J. Christopher},\n\tyear         = 2020,\n\tjournal      = {IEEE Robotics and Automation Letters},\n\tpublisher    = {IEEE},\n\tvolume       = 5,\n\tnumber       = 4,\n\tpages        = {6702--6709},\n\turl_link     = {https://ieeexplore.ieee.org/document/9165009},\n\turl_paper    = {https://tidel.mie.utoronto.ca/pubs/Booth-RA-L-2020_postprint.pdf}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Integer programming techniques for minor-embedding in quantum annealers.\n \n \n \n \n\n\n \n Bernal, D. E; Booth, K. E. C.; Dridi, R.; Alghassi, H.; Tayur, S.; and Venturelli, D.\n\n\n \n\n\n\n In Proceedings of the International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR2020), pages In press, 2020. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Integer paper\n  \n \n \n \"Integer link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{bernal2019integer,\n\ttitle        = {Integer programming techniques for minor-embedding in quantum annealers},\n\tauthor       = {Bernal, David E and Booth, Kyle E. C. and Dridi, Raouf and Alghassi, Hedayat and Tayur, Sridhar and Venturelli, Davide},\n\tyear         = 2020,\n\tbooktitle    = {Proceedings of the International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR2020)},\n\tpages        = {In press},\n\torganization = {Springer},\n\turl_paper    = {https://arxiv.org/pdf/1912.08314.pdf},\n\turl_link     = {https://arxiv.org/abs/1912.08314}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Branch-and-check methods for multi-level operating room planning and scheduling.\n \n \n \n \n\n\n \n Roshanaei, V.; Booth, K. E. C.; Aleman, D. M; Urbach, D. R; and Beck, J C.\n\n\n \n\n\n\n International Journal of Production Economics, 220: 107433. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"Branch-and-check paper\n  \n \n \n \"Branch-and-check link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{roshanaei2019branch,\n\ttitle        = {Branch-and-check methods for multi-level operating room planning and scheduling},\n\tauthor       = {Roshanaei, Vahid and Booth, Kyle E. C. and Aleman, Dionne M and Urbach, David R and Beck, J Christopher},\n\tyear         = 2020,\n\tjournal      = {International Journal of Production Economics},\n\tpublisher    = {Elsevier},\n\tvolume       = 220,\n\tnumber       = {},\n\tpages        = 107433,\n\turl_paper    = {https://tidel.mie.utoronto.ca/pubs/MLORPS-2019.pdf},\n\turl_link     = {https://www.sciencedirect.com/science/article/abs/pii/S0925527319302439}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A mathematical optimization framework for expansion draft decision making and analysis.\n \n \n \n \n\n\n \n Booth, K. E. C.; Chan, T. C.; and Shalaby, Y.\n\n\n \n\n\n\n Journal of Quantitative Analysis in Sports, 15(1): 27–40. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"A paper\n  \n \n \n \"A link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{booth2019mathematical,\n\ttitle        = {A mathematical optimization framework for expansion draft decision making and analysis},\n\tauthor       = {Booth, Kyle E. C. and Chan, Timothy CY and Shalaby, Yusuf},\n\tyear         = 2019,\n\tjournal      = {Journal of Quantitative Analysis in Sports},\n\tpublisher    = {De Gruyter},\n\tvolume       = 15,\n\tnumber       = 1,\n\tpages        = {27--40},\n\turl_paper    = {https://www.researchgate.net/profile/Kyle_Booth2/publication/331134194_A_mathematical_optimization_framework_for_expansion_draft_decision_making_and_analysis/links/5c733f94299bf1268d22ca2c/A-mathematical-optimization-framework-for-expansion-draft-decision-making-and-analysis.pdf},\n\turl_link     = {https://www.degruyter.com/view/j/jqas.2019.15.issue-1/jqas-2018-0024/jqas-2018-0024.xml}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A constraint programming approach to electric vehicle routing with time windows.\n \n \n \n \n\n\n \n Booth, K. E. C.; and Beck, J C.\n\n\n \n\n\n\n In Proceedings of the International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR2019), pages 129–145, 2019. Springer\n \n\n\n\n
\n\n\n\n \n \n \"A paper\n  \n \n \n \"A link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 12 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{booth2019constraint,\n\ttitle        = {A constraint programming approach to electric vehicle routing with time windows},\n\tauthor       = {Booth, Kyle E. C. and Beck, J Christopher},\n\tyear         = 2019,\n\tbooktitle    = {Proceedings of the International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR2019)},\n\tpages        = {129--145},\n\torganization = {Springer},\n\turl_paper    = {https://tspace.library.utoronto.ca/bitstream/1807/93822/3/A\\%20Constrant\\%20Programming_TSpace.pdf},\n\turl_link     = {https://link.springer.com/chapter/10.1007/978-3-030-19212-9_9}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Learning scheduling models from event data.\n \n \n \n \n\n\n \n Senderovich, A.; Booth, K. E. C.; and Beck, J C.\n\n\n \n\n\n\n In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS2019), volume 29, pages 401–409, 2019. AAAI\n \n\n\n\n
\n\n\n\n \n \n \"Learning paper\n  \n \n \n \"Learning link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{senderovich2019learning,\n\ttitle        = {Learning scheduling models from event data},\n\tauthor       = {Senderovich, Arik and Booth, Kyle E. C. and Beck, J Christopher},\n\tyear         = 2019,\n\tbooktitle    = {Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS2019)},\n\tvolume       = 29,\n\tnumber       = 1,\n\tpages        = {401--409},\n\torganization = {AAAI},\n\turl_paper    = {https://tidel.mie.utoronto.ca/pubs/Senderovich_ICAPS2019.pdf},\n\turl_link     = {https://www.aaai.org/ojs/index.php/ICAPS/article/view/3504}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Quantum circuit compilation: An emerging application for automated reasoning.\n \n \n \n \n\n\n \n Venturelli, D.; Do, M.; O'Gorman, B.; Frank, J.; Rieffel, E.; Booth, K. E. C.; Nguyen, T.; Narayan, P.; and Nanda, S.\n\n\n \n\n\n\n In Proceedings of the Scheduling and Planning Applications Workshop (SPARK2019), 2019. \n \n\n\n\n
\n\n\n\n \n \n \"Quantum paper\n  \n \n \n \"Quantum link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{venturelli2019quantum,\n\ttitle        = {Quantum circuit compilation: An emerging application for automated reasoning},\n\tauthor       = {Venturelli, Davide and Do, Minh and O'Gorman, Bryan and Frank, Jeremy and Rieffel, Eleanor and Booth, Kyle E. C. and Nguyen, Thanh and Narayan, Parvathi and Nanda, Sasha},\n\tyear         = 2019,\n\tbooktitle    = {Proceedings of the Scheduling and Planning Applications Workshop (SPARK2019)},\n\turl_paper    = {https://pdfs.semanticscholar.org/6fcf/f8f1626c864b12ffc1e398ae9ab40cd12f0f.pdf},\n\turl_link     = {https://openreview.net/forum?id=S1eEBO3nFE}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Comparing and integrating constraint programming and temporal planning for quantum circuit compilation.\n \n \n \n \n\n\n \n Booth, K. E. C.; Do, M.; Beck, J C.; Rieffel, E.; Venturelli, D.; and Frank, J.\n\n\n \n\n\n\n In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS2018), pages 366–374, 2018. AAAI\n \n\n\n\n
\n\n\n\n \n \n \"Comparing paper\n  \n \n \n \"Comparing link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{booth2018comparing,\n\ttitle        = {Comparing and integrating constraint programming and temporal planning for quantum circuit compilation},\n\tauthor       = {Booth, Kyle E. C. and Do, Minh and Beck, J Christopher and Rieffel, Eleanor and Venturelli, Davide and Frank, Jeremy},\n\tyear         = 2018,\n\tbooktitle    = {Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS2018)},\n\tpages        = {366--374},\n\torganization = {AAAI},\n\turl_paper    = {https://tidel.mie.utoronto.ca/pubs/ICAPS-2018-Booth.pdf},\n\turl_link     = {https://www.aaai.org/ocs/index.php/ICAPS/ICAPS18/paper/viewPaper/17787}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Intruder alert! Optimization models for solving the mobile robot graph-clear problem.\n \n \n \n \n\n\n \n Morin, M.; Castro, M. P; Booth, K. E. C.; Tran, T. T; Liu, C.; and Beck, J C.\n\n\n \n\n\n\n Constraints, 23(3): 335–354. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"Intruder paper\n  \n \n \n \"Intruder link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{morin2018intruder,\n\ttitle        = {Intruder alert! Optimization models for solving the mobile robot graph-clear problem},\n\tauthor       = {Morin, Michael and Castro, Margarita P and Booth, Kyle E. C. and Tran, Tony T and Liu, Chang and Beck, J Christopher},\n\tyear         = 2018,\n\tjournal      = {Constraints},\n\tpublisher    = {Springer},\n\tvolume       = 23,\n\tnumber       = 3,\n\tpages        = {335--354},\n\turl_paper    = {https://tspace.library.utoronto.ca/bitstream/1807/87983/1/GCP_Constraints_2018.pdf},\n\turl_link     = {https://link.springer.com/article/10.1007/s10601-018-9288-3}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Robots in retirement homes: Person search and task planning for a group of residents by a team of assistive robots.\n \n \n \n \n\n\n \n Booth, K. E. C.; Mohamed, S. C; Rajaratnam, S.; Nejat, G.; and Beck, J C.\n\n\n \n\n\n\n IEEE Intelligent Systems, 32(6): 14–21. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"Robots paper\n  \n \n \n \"Robots link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 10 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{booth2017robots,\n\ttitle        = {Robots in retirement homes: Person search and task planning for a group of residents by a team of assistive robots},\n\tauthor       = {Booth, Kyle E. C. and Mohamed, Sharaf C and Rajaratnam, Sanjif and Nejat, Goldie and Beck, J Christopher},\n\tyear         = 2017,\n\tjournal      = {IEEE Intelligent Systems},\n\tpublisher    = {IEEE},\n\tvolume       = 32,\n\tnumber       = 6,\n\tpages        = {14--21},\n\turl_paper    = {https://tidel.mie.utoronto.ca/pubs/Booth-IEEE-IS_2017-Postprint.pdf},\n\turl_link     = {https://ieeexplore.ieee.org/abstract/document/8268000}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A constraint programming approach to multi-robot task allocation and scheduling in retirement homes.\n \n \n \n \n\n\n \n Booth, K. E. C.; Nejat, G.; and Beck, J C.\n\n\n \n\n\n\n In Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP2016), pages 539–555, 2016. Springer\n \n\n\n\n
\n\n\n\n \n \n \"A paper\n  \n \n \n \"A link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{booth2016constraint,\n\ttitle        = {A constraint programming approach to multi-robot task allocation and scheduling in retirement homes},\n\tauthor       = {Booth, Kyle E. C. and Nejat, Goldie and Beck, J Christopher},\n\tyear         = 2016,\n\tbooktitle    = {Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP2016)},\n\tpages        = {539--555},\n\torganization = {Springer},\n\turl_paper    = {https://tspace.library.utoronto.ca/bitstream/1807/81341/1/Booth_CP2016.pdf},\n\turl_link     = {https://link.springer.com/chapter/10.1007/978-3-319-44953-1_34}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Mixed-integer and constraint programming techniques for mobile robot task planning.\n \n \n \n \n\n\n \n Booth, K. E. C.; Tran, T. T; Nejat, G.; and Beck, J C.\n\n\n \n\n\n\n IEEE Robotics and Automation Letters, 1(1): 500–507. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"Mixed-integer paper\n  \n \n \n \"Mixed-integer link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 15 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{booth2016mixed,\n\ttitle        = {Mixed-integer and constraint programming techniques for mobile robot task planning},\n\tauthor       = {Booth, Kyle E. C. and Tran, Tony T and Nejat, Goldie and Beck, J Christopher},\n\tyear         = 2016,\n\tjournal      = {IEEE Robotics and Automation Letters},\n\tpublisher    = {IEEE},\n\tvolume       = 1,\n\tnumber       = 1,\n\tpages        = {500--507},\n\turl_paper    = {https://tspace.library.utoronto.ca/bitstream/1807/71454/1/LRA2522096.pdf},\n\turl_link     = {https://ieeexplore.ieee.org/abstract/document/7393463}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Logic-based decomposition methods for the travelling purchaser problem.\n \n \n \n \n\n\n \n Booth, K. E. C.; Tran, T. T; and Beck, J C.\n\n\n \n\n\n\n In Proceedings of the International Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR2016), pages 55–64, 2016. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Logic-based paper\n  \n \n \n \"Logic-based link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{booth2016logic,\n\ttitle        = {Logic-based decomposition methods for the travelling purchaser problem},\n\tauthor       = {Booth, Kyle E. C. and Tran, Tony T and Beck, J Christopher},\n\tyear         = 2016,\n\tbooktitle    = {Proceedings of the International Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR2016)},\n\tpages        = {55--64},\n\torganization = {Springer},\n\turl_paper    = {https://tspace.library.utoronto.ca/bitstream/1807/72415/1/Booth_CPAIOR2016.pdf},\n\turl_link     = {https://link.springer.com/chapter/10.1007/978-3-319-33954-2_5}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Decomposition methods for the travelling purchaser problem.\n \n \n \n \n\n\n \n Booth, K. E. C.; Tran, T. T; and Beck, J C.\n\n\n \n\n\n\n In International Symposium on Artificial Intelligence and Mathematics (ISAIM2016), 2016. \n \n\n\n\n
\n\n\n\n \n \n \"Decomposition paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{booth2016decomposition,\n\ttitle        = {Decomposition methods for the travelling purchaser problem.},\n\tauthor       = {Booth, Kyle E. C. and Tran, Tony T and Beck, J Christopher},\n\tyear         = 2016,\n\tbooktitle    = {International Symposium on Artificial Intelligence and Mathematics (ISAIM2016)},\n\turl_paper    = {http://icaps16.icaps-conference.org/proceedings/dc/dc16.pdf#page=129}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);