2022
DOI: 10.1016/j.ejor.2021.05.029
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of effective sets of routes for the split-delivery periodic inventory routing problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 40 publications
0
1
0
Order By: Relevance
“…They present a branch and-cut algorithm with new valid inequalities. Bertazzi et al [7] propose a matheuristic solution approach for the Periodic IRP, in which a route-based formulation of the problem is solved to optimality for a given subset of routes. They also show how to design effective subsets of routes.…”
Section: Cyclic Inventory Routingmentioning
confidence: 99%
“…They present a branch and-cut algorithm with new valid inequalities. Bertazzi et al [7] propose a matheuristic solution approach for the Periodic IRP, in which a route-based formulation of the problem is solved to optimality for a given subset of routes. They also show how to design effective subsets of routes.…”
Section: Cyclic Inventory Routingmentioning
confidence: 99%