Verification of correctness of parallel algorithms in practice
From MaRDI portal
Publication:4609778
DOI10.1007/978-3-319-59861-1_9zbMATH Open1382.68323OpenAlexW2703924393MaRDI QIDQ4609778FDOQ4609778
Authors: Jakub Nalepa, Miroslaw Blocho
Publication date: 26 March 2018
Published in: Recent Advances in Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-59861-1_9
Recommendations
Cites Work
- A grouping genetic algorithm for the pickup and delivery problem with time windows
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
- An exact algorithm for the pickup and delivery problem with time windows
- Parallel Metaheuristics Applications
- Recent models and algorithms for one-to-one pickup and delivery problems
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
- Proving Liveness Properties of Concurrent Programs
- Parallel Strategies for Meta-Heuristics
- Mathematical theory of partial correctness
- Introduction to parallel computing
Cited In (5)
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)