Verification of Correctness of Parallel Algorithms in Practice

DOI10.1007/978-3-319-59861-1_9zbMath1382.68323OpenAlexW2703924393MaRDI QIDQ4609778

Miroslaw Blocho, Jakub Nalepa

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

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers
• A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• 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
• Mathematical theory of partial correctness
• Introduction to Parallel Computing
• An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Parallel Metaheuristics Applications
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
• Proving Liveness Properties of Concurrent Programs
• Parallel Strategies for Meta-Heuristics

This page was built for publication: Verification of Correctness of Parallel Algorithms in Practice