UPS-\(k\): a set partitioning problem with applications in UPS pickup-delivery system

DOI10.1016/J.IPL.2004.10.010zbMath1173.68863OpenAlexW2001013909MaRDI QIDQ835021

Ming-Hui Jiang

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.10.010

zbMATH Keywords

NP-completeapproximation algorithmsstrip packingset partitioningUPS scheduling

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• A Strip-Packing Algorithm with Absolute Performance Bound 2

This page was built for publication: UPS-\(k\): a set partitioning problem with applications in UPS pickup-delivery system