mts: a light framework for parallelizing tree search codes
| Autor: | Charles Jordan, David Avis |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
021103 operations research
Control and Optimization Spanning tree Theoretical computer science Branch and bound Backtracking Applied Mathematics Reverse search 0211 other engineering and technologies 02 engineering and technology Satisfiability Tree (data structure) Parallel processing (DSP implementation) 0202 electrical engineering electronic engineering information engineering Computer Science::Programming Languages 020201 artificial intelligence & image processing Software Mathematics |
| Zdroj: | Optimization Methods and Software. 36:279-300 |
| ISSN: | 1029-4937 1055-6788 |
| DOI: | 10.1080/10556788.2019.1692344 |
| Popis: | We describe mts, a generic framework for parallelizing certain types of tree search programmes including reverse search, backtracking, branch and bound and satisfiability testing. It abstracts and ... |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|