{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T05:58:03Z","timestamp":1790747883940,"version":"4.1.0"},"reference-count":45,"publisher":"Informa UK Limited","issue":"2-3","funder":[{"DOI":"10.13039\/501100001691","name":"JSPS-Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["16H02785"],"award-info":[{"award-number":["16H02785"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"JSPS-Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["18K18027"],"award-info":[{"award-number":["18K18027"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"JSPS-Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["23700019"],"award-info":[{"award-number":["23700019"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"JSPS-Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["15H00847"],"award-info":[{"award-number":["15H00847"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2021,5,4]]},"DOI":"10.1080\/10556788.2019.1692344","type":"journal-article","created":{"date-parts":[[2019,11,22]],"date-time":"2019-11-22T10:17:30Z","timestamp":1574417850000},"page":"279-300","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":3,"title":["mts: a light framework for parallelizing tree search codes"],"prefix":"10.1080","volume":"36","author":[{"given":"David","family":"Avis","sequence":"first","affiliation":[{"name":"School of Informatics, Kyoto University, Kyoto, Japan"},{"name":"School of Computer Science, McGill University, Montr\u00e9al, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charles","family":"Jordan","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2019,11,22]]},"reference":[{"key":"CIT0001","doi-asserted-by":"crossref","unstructured":"G. Audemard, J.M. Lagniez, N. Szczepanski, and S. Tabary,An Adaptive Parallel SAT Solver, inCP, LNCS Vol. 9892. 2016, pp. 30\u201348.","DOI":"10.1007\/978-3-319-44953-1_3"},{"key":"CIT0002","unstructured":"G. Audemard and L. Simon,Predicting Learnt Clauses Quality in Modern SAT Solvers, inIJCAI. 2009, pp. 399\u2013404."},{"key":"CIT0003","doi-asserted-by":"crossref","unstructured":"G. Audemard and L. Simon,Lazy Clause Exchange Policy for Parallel SAT Solvers, inSAT, LNCS Vol. 8561. 2014, pp. 197\u2013205.","DOI":"10.1007\/978-3-319-09284-3_15"},{"key":"CIT0004","unstructured":"D. Avis and L. Devroye,An analysis of budgeted parallel search on conditional Galton-Watson trees, arXiv:1703.10731 (2017)."},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00026-N"},{"key":"CIT0006","unstructured":"D. Avis and C. Jordan,Reverse search: Tutorials(2000,2016). Available at http:\/\/cgm.cs.mcgill.ca\/avis\/doc\/tutorial."},{"key":"CIT0007","unstructured":"D. Avis and C. Jordan,A parallel framework for reverse search using mts, 2016. arXiv:1610.07735."},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-017-0129-y"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.08.007"},{"key":"CIT0010","doi-asserted-by":"crossref","unstructured":"T. Balyo, M.J. Heule, and M. J\u00e4rvisalo,SAT Competition 2016: Recent Developments, inAAAI. 2017.","DOI":"10.1609\/aaai.v31i1.10641"},{"key":"CIT0011","unstructured":"A. Biere,Lingeling and Friends Entering the SAT Challenge 2012, inProc. SAT Challenge 2012, Department of Computer Science Series of Publications B, University of Helsinki Vol. B-2012-2. 2012, pp. 33\u201334."},{"key":"CIT0012","volume-title":"Handbook of Satisfiability","author":"Biere A.","year":"2009"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018972901171"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1080\/10556780802086300"},{"key":"CIT0016","unstructured":"Combinatorial object server: Linear extensions. Available at http:\/\/theory.cs.uvic.ca\/inf\/pose\/LinearExt.html."},{"key":"CIT0017","doi-asserted-by":"crossref","unstructured":"T.G. Crainic, B. Le Cun, and C. Roucairol,Parallel Branch-and-Bound Algorithms, inParallel Combinatorial Optimization, John Wiley & Sons, Inc. (2006), pp. 1\u201328.","DOI":"10.1002\/9780470053928.ch1"},{"key":"CIT0018","doi-asserted-by":"crossref","unstructured":"J.A. De Loera, J. Rambau, and F. Santos,Triangulations, Algorithms and Computation in Mathematics, Vol. 25, Springer-Verlag, 2010.","DOI":"10.1007\/978-3-642-12971-1"},{"key":"CIT0019","unstructured":"A. Djerrah, B. Le Cun, V.D. Cung, and C. Roucairol,Bob++: Framework for solving optimization problems with branch-and-bound methods, in2006 15th IEEE International Conference on High Performance Distributed Computing. 2006, pp. 369\u2013370."},{"key":"CIT0020","doi-asserted-by":"crossref","unstructured":"N. E\u00e9n and N. S\u00f6rensson,An Extensible SAT-solver, inSAT, LNCS, Vol. 2919. 2003, pp. 502\u2013518.","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.04.011"},{"key":"CIT0022","doi-asserted-by":"crossref","unstructured":"E. Gawrilow and M. Joswig,polymake:a framework for analyzing convex polytopes, inPolytopes\u2013combinatorics and computation (Oberwolfach, 1997), DMV Sem. Vol. 29, Birkh\u00e4user, Basel, 2000, pp. 43\u201373.","DOI":"10.1007\/978-3-0348-8438-9_2"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011416310759"},{"key":"CIT0024","doi-asserted-by":"crossref","unstructured":"Y. Hamadi and C.M. Wintersteiger,Seven challenges in parallel SAT solving, inAAAI. 2012, pp. 2120\u20132125.","DOI":"10.1609\/aaai.v26i1.8438"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-017-0508-y"},{"key":"CIT0026","doi-asserted-by":"crossref","unstructured":"M.J. Heule, O. Kullmann, and V.W. Marek,Solving and verifying the boolean pythagorean triples problem via cube-and-conquer, inSAT, LNCS Vol. 9710. 2016, pp. 228\u2013245.","DOI":"10.1007\/978-3-319-40970-2_15"},{"key":"CIT0027","doi-asserted-by":"crossref","unstructured":"M.J. Heule, O. Kullmann, S. Wieringa, and A. Biere,Cube and conquer: Guiding CDCL SAT solvers by lookaheads, inHVC, LNCS Vol. 7261. 2012.","DOI":"10.1007\/978-3-642-34188-5_8"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195902000980"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.37236\/7318"},{"key":"CIT0030","doi-asserted-by":"crossref","unstructured":"M. Joswig and L. Kastner,New counts for the number of triangulations of cyclic polytopes, inICMS, LNCS Vol. 10931. 2018, pp. 264\u2013271.","DOI":"10.1007\/978-3-319-96418-8_31"},{"key":"CIT0031","doi-asserted-by":"crossref","unstructured":"G. Katsirelos, A. Sabharwal, H. Samulowitz, and L. Simon,Resolution and parallelizability: Barriers to the efficient parallelization of SAT solvers, inAAAI. 2013, pp. 481\u2013488.","DOI":"10.1609\/aaai.v27i1.8660"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.2307\/3212730"},{"key":"CIT0033","unstructured":"D.E. Knuth,Programs to read. Available at http:\/\/www-cs-faculty.stanford.edu\/uno\/programs.html."},{"key":"CIT0034","volume-title":"The Art of Computer Programming","volume":"4","author":"Knuth D.E.","year":"2011"},{"key":"CIT0035","unstructured":"A. Marzetta,ZRAM: A library of parallel search algorithms and its use in enumeration and combinatorial optimization, Ph.D. diss., Swiss Federal Institute of Technology Zurich, 1998."},{"key":"CIT0036","volume-title":"Patterns for Parallel Programming","author":"Mattson T.","year":"2004","edition":"1"},{"key":"CIT0037","doi-asserted-by":"publisher","DOI":"10.1145\/2742359"},{"key":"CIT0038","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1978-085-0"},{"key":"CIT0039","volume-title":"Counting Labelled Trees","author":"Moon J.","year":"1970"},{"key":"CIT0040","doi-asserted-by":"publisher","DOI":"10.1137\/0404037"},{"key":"CIT0041","doi-asserted-by":"crossref","unstructured":"J. Rambau,TOPCOM: Triangulations of point configurations and oriented matroids, inMathematical Software\u2014ICMS 2002. World Scientific, 2002, pp. 330\u2013340. Available at http:\/\/nbn-resolving.de\/urn:nbn:de:0297-zib-6849.","DOI":"10.1142\/9789812777171_0035"},{"key":"CIT0042","volume-title":"Intel Threading Building Blocks","author":"Reinders J.","year":"2007"},{"key":"CIT0043","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-018-0021-1"},{"key":"CIT0044","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/24.1.83"},{"key":"CIT0045","doi-asserted-by":"crossref","unstructured":"C. Weibel,Implementation and Parallelization of a Reverse-Search Algorithm for Minkowski Sums, in2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX). 2010, pp. 34\u201342.","DOI":"10.1137\/1.9781611972900.4"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2019.1692344","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T18:21:00Z","timestamp":1665080460000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2019.1692344"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,22]]},"references-count":45,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2021,5,4]]}},"alternative-id":["10.1080\/10556788.2019.1692344"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2019.1692344","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,22]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2019-03-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-10-28","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-11-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}