Pages that link to "Item:Q2286875"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries (Q2286875):
Displaying 20 items.
- The exact solution of several classes of inventory-routing problems (Q340258) (← links)
- Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery (Q408394) (← links)
- A branch-and-price algorithm for an integrated production and inventory routing problem (Q991383) (← links)
- Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment (Q1651650) (← links)
- Inventory routing with pickups and deliveries (Q1754327) (← links)
- Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation (Q2029903) (← links)
- A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system (Q2160517) (← links)
- Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries (Q2242202) (← links)
- A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
- Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products (Q2286968) (← links)
- An exact solution approach for the inventory routing problem with time windows (Q2669489) (← links)
- A matheuristic for solving inventory sharing problems (Q2669710) (← links)
- An improved formulation for the inventory routing problem with time-varying demands (Q2672144) (← links)
- A column-generation based tactical planning method for inventory routing (Q2917633) (← links)
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems (Q2967617) (← links)
- Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem (Q2969619) (← links)
- A branch-and-cut embedded matheuristic for the inventory routing problem (Q6047912) (← links)
- A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs (Q6064162) (← 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)
