Pages that link to "Item:Q4642458"
From MaRDI portal
The following pages link to Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances (Q4642458):
Displaying 17 items.
- Heuristics for dynamic and stochastic inventory-routing (Q337178) (← links)
- Integrated inventory routing and freight consolidation for perishable goods (Q724138) (← links)
- Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment (Q1651650) (← links)
- Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm (Q1652448) (← links)
- Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation (Q2029903) (← links)
- Analysis of effective sets of routes for the split-delivery periodic inventory routing problem (Q2076819) (← links)
- Comparison of formulations for the inventory routing problem (Q2160484) (← links)
- A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries (Q2286875) (← links)
- A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
- An exact approach for cyclic inbound inventory routing in a level production system (Q2294631) (← links)
- An exact solution approach for the inventory routing problem with time windows (Q2669489) (← links)
- An improved formulation for the inventory routing problem with time-varying demands (Q2672144) (← links)
- Formulations for an inventory routing problem (Q4979996) (← links)
- Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem (Q5087709) (← links)
- A branch-and-cut embedded matheuristic for the inventory routing problem (Q6047912) (← links)
- Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery (Q6087075) (← links)
- On the zero-inventory-ordering policy in the inventory routing problem (Q6087504) (← links)