Verification of correctness of parallel algorithms in practice
From MaRDI portal
Publication:4609778
Recommendations
Cites work
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
- A grouping genetic algorithm for the pickup and delivery problem with time windows
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
- An exact algorithm for the pickup and delivery problem with time windows
- Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers
- Introduction to parallel computing
- Mathematical theory of partial correctness
- Parallel Metaheuristics Applications
- Parallel Strategies for Meta-Heuristics
- Proving Liveness Properties of Concurrent Programs
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Recent models and algorithms for one-to-one pickup and delivery problems
Cited in
(5)- scientific article; zbMATH DE number 4133475 (Why is no real title available?)
- Parallel Repetition of Computationally Sound Protocols Revisited
- Verifying the correctness of parallel logical control algorithms
- Designing checkers for programs that run in parallel
- scientific article; zbMATH DE number 6533780 (Why is no real title available?)
This page was built for publication: Verification of correctness of parallel algorithms in practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4609778)