PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE
From MaRDI portal
Recommendations
- Measuring and evaluating parallel state-space exploration algorithms
- Parallel state-space search for a first solution with consistent linear speedups
- scientific article; zbMATH DE number 4090815
- Search-space partitioning for parallelizing SMT solvers
- Parallel Greedy Randomized Adaptive Search Procedures
Cites work
- An Algorithm for the Traveling Salesman Problem
- Anomalies in parallel branch-and-bound algorithms
- Generalized best-first search strategies and the optimality of A*
- Parallel state-space search for a first solution with consistent linear speedups
- Randomized parallel algorithms for backtrack search and branch-and-bound computation
- The reduce-or process model for parallel execution of logic programs
Cited in
(6)- scientific article; zbMATH DE number 4058911 (Why is no real title available?)
- A first implementation of ParaXpress: combining internal and external parallelization to solve MIPs on supercomputers
- scientific article; zbMATH DE number 4090815 (Why is no real title available?)
- scientific article; zbMATH DE number 2080054 (Why is no real title available?)
- FiberSCIP—A Shared Memory Parallelization of SCIP
- ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers
This page was built for publication: PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3144924)