Pages that link to "Item:Q5219699"
From MaRDI portal
The following pages link to The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard (Q5219699):
Displaying 7 items.
- On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4] (Q860874) (← links)
- NP-hardness proof for the assembly problem with stationary setup and additive holding costs (Q1949675) (← links)
- The joint replenishment problem with trade credits (Q2301195) (← links)
- Optimization of a stochastic joint replenishment inventory system with service level constraints (Q2676403) (← links)
- Complexity of the Project Sequencing Problem (Q3325432) (← links)
- Efficient methods for stochastic joint replenishment and delivery problem (Q6071057) (← links)
- Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation (Q6109334) (← links)
