Pages that link to "Item:Q547123"
From MaRDI portal
The following pages link to Analysis of the maximum level policy in a production-distribution system (Q547123):
Displayed 29 items.
- The production routing problem: a review of formulations and solution algorithms (Q337418) (← 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 variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines (Q1652346) (← links)
- A multi-phase heuristic for the production routing problem (Q1652406) (← links)
- Heuristics based on genetic algorithms for the capacitated multi vehicle production distribution problem (Q1652661) (← links)
- Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← 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)
- 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)
- An infeasible space exploring matheuristic for the production routing problem (Q2076821) (← links)
- The inventory replenishment policy in an uncertain production-inventory-routing system (Q2083392) (← links)
- A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
- A matheuristic solution approach for the production routing problem with visit spacing policy (Q2312350) (← links)
- A heuristic algorithm for the free newspaper delivery problem (Q2355940) (← 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)
- Rolling horizon-based heuristics for solving a production-routing problem with price-dependent demand (Q2676371) (← links)
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems (Q2967617) (← links)
- Benders Decomposition for Production Routing Under Demand Uncertainty (Q3465587) (← links)
- A Matheuristic for the Multivehicle Inventory Routing Problem (Q4599309) (← links)
- A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing (Q5137442) (← links)
- Two‐echelon manufacturer–retailer supply chain strategies with price, quality, and promotional effort sensitive demand (Q5744004) (← links)
- Mixed integer formulations for a coupled lot-scheduling and vehicle routing problem in furniture settings (Q5884389) (← links)
- Multi-product production routing problem by consideration of outsourcing and carbon emissions: particle swarm optimization (Q6094366) (← links)