Pages that link to "Item:Q2967617"
From MaRDI portal
The following pages link to Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems (Q2967617):
Displayed 50 items.
- Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
- A hybrid heuristic based on iterated local search for multivehicle inventory routing problem (Q325440) (← links)
- The production routing problem: a review of formulations and solution algorithms (Q337418) (← links)
- GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem (Q503664) (← links)
- Integrated inventory routing and freight consolidation for perishable goods (Q724138) (← links)
- A decomposition heuristic for a rich production routing problem (Q1651659) (← links)
- Multiscale production routing in multicommodity supply chains with complex production facilities (Q1652168) (← links)
- A multi-phase heuristic for the production routing problem (Q1652406) (← links)
- Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm (Q1652448) (← links)
- Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs (Q1652711) (← links)
- Three-phase methodology incorporating scatter search for integrated production, inventory, and distribution routing problem (Q1665302) (← links)
- GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem (Q1687640) (← links)
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
- The dynamic bowser routing problem (Q1711454) (← links)
- Research on routing algorithm based on limitation arrangement principle in mathematics (Q1718627) (← links)
- Optimization of vehicle routing with pickup based on multibatch production (Q1727038) (← links)
- A stochastic reverse logistics production routing model with environmental considerations (Q1730592) (← links)
- Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: a case-study in the biomass supply chain (Q1735180) (← links)
- Comparing sequential and integrated approaches for the production routing problem (Q1750476) (← links)
- Optimization model for a production, inventory, distribution and routing problem in small furniture companies (Q1752350) (← links)
- Inventory routing with pickups and deliveries (Q1754327) (← links)
- An efficient three-level heuristic for the large-scaled multi-product production routing problem with outsourcing (Q1991216) (← links)
- The two-echelon production-routing problem (Q2028880) (← links)
- Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation (Q2029903) (← links)
- Optimal inventory level control and replenishment plan for retailers (Q2031242) (← links)
- Analysis of effective sets of routes for the split-delivery periodic inventory routing problem (Q2076819) (← links)
- An infeasible space exploring matheuristic for the production routing problem (Q2076821) (← links)
- Models and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor (Q2116934) (← links)
- Inventory routing in a warehouse: the storage replenishment routing problem (Q2140300) (← links)
- Stochastic production routing problem for perishable products: modeling and a solution algorithm (Q2146985) (← links)
- Comparison of formulations for the inventory routing problem (Q2160484) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem (Q2208364) (← 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 approach for cyclic inbound inventory routing in a level production system (Q2294631) (← links)
- A mathematical programming model for integrating production and procurement transport decisions (Q2294862) (← links)
- A matheuristic solution approach for the production routing problem with visit spacing policy (Q2312350) (← links)
- Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs (Q2333123) (← links)
- An inventory-routing problem with the objective of travel time minimization (Q2514745) (← links)
- Solving a production-routing problem with price-dependent demand using an outer approximation method (Q2664354) (← links)
- A mathematical programming-based heuristic for the production routing problem with transshipments (Q2664374) (← 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)
- A matheuristic for solving inventory sharing problems (Q2669710) (← links)
- An improved formulation for the inventory routing problem with time-varying demands (Q2672144) (← links)
- A survey of adaptive large neighborhood search algorithms and applications (Q2676311) (← links)
- Rolling horizon-based heuristics for solving a production-routing problem with price-dependent demand (Q2676371) (← links)
- A branch-and-cut approach for the distributed no-wait flowshop scheduling problem (Q2676404) (← links)
- The inventory routing problem: the value of integration (Q2811934) (← links)