Improved approximation for the capacitated inventory access point problem

Marfurt Alarcon, Miguel Angel; Chaves Pedrosa, Lehilton Lelis

Advanced search

Search - Use quotation marks to get a more specific result

Index

Field of knowledge

Start date

Betweenand

(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Improved approximation for the capacitated inventory access point problem

Full text
Author(s):	Marfurt Alarcon, Miguel Angel ^[1] ; Chaves Pedrosa, Lehilton Lelis ^[1] Total Authors: 2
Affiliation:	^[1] Inst Comp, Av Albert Einstein 1251, Cidade Univ, BR-13083852 Campinas, SP - Brazil Total Affiliations: 1
Document type:	Journal article
Source:	OPERATIONS RESEARCH LETTERS; v. 49, n. 6, p. 874-876, NOV 2021.
Web of Science Citations:	0
Abstract
The Inventory Access Point (IAP) is the single-item lot-sizing problem where a single customer faces demands in a discrete planning horizon, and the goal is to find a replenishment policy that minimizes the total inventory and ordering costs. While the uncapacitated version is polynomial, only a 3-approximation is known for the capacitated case. We improve this factor to 2.619 and, as a byproduct, we also improve the best factor for SIRPFL, which is a variant with multiple depots and customers. (C) 2021 Elsevier B.V. All rights reserved. (AU)

FAPESP's process:	15/11937-9 - Investigation of hard problems from the algorithmic and structural stand points
Grantee:	Flávio Keidi Miyazawa
Support Opportunities:	Research Projects - Thematic Grants

Short URL