Pages that link to "Item:Q2029903"
From MaRDI portal
The following pages link to Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation (Q2029903):
Displaying 12 items.
- An infeasible space exploring matheuristic for the production routing problem (Q2076821) (← links)
- A genetic algorithm for solving the inventory routing problem with time windows (Q2086696) (← links)
- A shortfall modelling-based solution approach for stochastic cyclic inventory routing (Q2098037) (← links)
- Comparison of formulations for the inventory routing problem (Q2160484) (← links)
- An iterative matheuristic for the inventory routing problem (Q2668692) (← 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)
- A branch-and-cut embedded matheuristic for the inventory routing problem (Q6047912) (← links)
- On the zero-inventory-ordering policy in the inventory routing problem (Q6087504) (← links)
- The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem (Q6164609) (← links)
- An exact criterion space search algorithm for a bi-objective blood collection problem (Q6168602) (← links)
- The inventory routing problem with split deliveries (Q6180028) (← links)
