Pages that link to "Item:Q3117702"

The following pages link to A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem (Q3117702):

Displaying 37 items.

• On reformulations for the one-warehouse multi-retailer problem (Q271926) (← links)
• The submodular joint replenishment problem (Q304238) (← links)
• Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales (Q322424) (← links)
• Approximation algorithms for inventory problems with submodular or routing costs (Q344939) (← links)
• Approximation algorithms for supply chain planning and logistics problems with market choice (Q647392) (← links)
• Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory (Q747754) (← links)
• Approximation algorithms for the joint replenishment problem with deadlines (Q906550) (← links)
• Uncapacitated two-level lot-sizing (Q991455) (← links)
• Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem (Q1631181) (← links)
• Heuristics based on genetic algorithms for the capacitated multi vehicle production distribution problem (Q1652661) (← links)
• Exact analysis of the $(R, Q)$ inventory policy in a two-echelon production-inventory system (Q1728247) (← links)
• Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system (Q1730678) (← links)
• Joint replenishment and carbon trading in fresh food supply chains (Q1737493) (← links)
• MIP formulations and heuristics for two-level production-transportation problems (Q1761227) (← links)
• The one-warehouse multi-retailer problem: reformulation, classification, and computational results (Q1761836) (← links)
• New results on multi-level aggregation (Q1998855) (← links)
• The warehouse-inventory-transportation problem for supply chains (Q2254000) (← links)
• A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure (Q2273683) (← links)
• Optimal utilization of ports' free-of-charge times in one distribution center and multiple ports inventory systems (Q2325145) (← links)
• An exact analysis of a joint production-inventory problem in two-echelon inventory systems (Q2892132) (← links)
• A constant approximation algorithm for the one-warehouse multi-retailer problem (Q2921691) (← links)
• Modified Echelon (<i>r, Q</i>) Policies with Guaranteed Performance Bounds for Stochastic Serial Inventory Systems (Q2931702) (← links)
• The one-warehouse multiretailer problem with an order-up-to level inventory policy (Q3065627) (← links)
• Inventory Models with Shelf-Age and Delay-Dependent Inventory Costs (Q3450469) (← links)
• The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem (Q3453284) (← links)
• Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem (Q3595394) (← links)
• Improved Approximation Algorithms for Inventory Problems (Q5041737) (← links)
• Combinatorial Heuristics for Inventory Routing Problems (Q5084657) (← links)
• Online Algorithms for Multilevel Aggregation (Q5130492) (← links)
• Integrated Supply Chain Management via Randomized Rounding (Q5131715) (← links)
• Single‐warehouse multi‐retailer inventory systems with full truckload shipments (Q5187943) (← links)
• The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard (Q5219699) (← links)
• Approximation algorithms for general one-warehouse multi-retailer systems (Q5305566) (← links)
• A CONTINUOUS REVIEW MODEL WITH GENERAL SHELF AGE AND DELAY-DEPENDENT INVENTORY COSTS (Q5358057) (← links)
• Supply Chain Management with Online Customer Selection (Q5740223) (← links)
• <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs (Q6072162) (← links)
• Joint replenishment meets scheduling (Q6102849) (← links)