Two approximation algorithms for solving the min-max heterogeneous weighted delivery problem

DOI10.1007/S10878-026-01450-3MaRDI QIDQ7346913zbMATH OpenFDO

Authors Jianping Li, Ping Yang, Junran Lichen, Runtao Xie

Publication date 11 September 2026

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-026-01450-3

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• An exact algorithm for simultaneous pickup and delivery problem with split demand and time windows
• Approximation algorithms for multi-vehicle stacker crane problems
• Approximation algorithms for solving the heterogeneous Chinese postman problem
• Capacitated vehicle routing with nonuniform speeds
• Combinatorial optimization. Theory and algorithms
• New approximation algorithms for the heterogeneous weighted delivery problem
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The design of approximation algorithms
• The dial-a-ride problem: Models and algorithms
• The pickup and delivery problem with time windows, multiple stacks, and handling operations
• Vehicle Routing

This page was built for publication: Two approximation algorithms for solving the min-max heterogeneous weighted delivery problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346913)