Issue |
RAIRO-Oper. Res.
Volume 59, Number 1, January-February 2025
|
|
---|---|---|
Page(s) | 325 - 333 | |
DOI | https://doi.org/10.1051/ro/2024232 | |
Published online | 21 January 2025 |
Approximation algorithms for the integrated path and bin packing problem
1
School of Mathematics and Statistics, Yunnan University, Kunming 650504, P.R. China
2
Dianchi College of Yunnan University, Kunming 650228, P.R. China
* Corresponding author: weidongmath@126.com
Received:
30
August
2023
Accepted:
28
December
2024
In this paper, we consider the integrated path and bin packing problem, which to use the minimum number of unit-size bins to packing the arcs on the path between two specific vertices in a given directed graph. We propose a 3/2-approximation algorithm and an asymptotic polynomial time approximation scheme.
Mathematics Subject Classification: 68W25 / 68W40
Key words: Bin packing / shortest path / approximation algorithm / asymptotic polynomial time approximation scheme
© The authors. Published by EDP Sciences, ROADEF, SMAI 2025
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.