Year: 2024
Type: article
Abstract: 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.
Source: RAIRO - Operations Research
DOI: 10.1051/ro/2024232
Authors: Weidong Li, Ruiqing Sun
Institutions: Yunnan University, Dianchi College
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: diamond
Award: G905374995
OpenAlex ID: W4405934357