The following pages link to The multi-period newsboy problem (Q2576256):
Displaying 22 items.
- Online ordering policies for a two-product, multi-period stationary newsvendor problem (Q342475) (← links)
- Unreliable newsboy problem with a forecast update (Q433130) (← links)
- Some general properties for the newsboy problem with an extraordinary order (Q456944) (← links)
- The newsboy problem under progressive multiple discounts (Q1127182) (← links)
- The newsstand problem: A capacitated multiple-product single-period inventory problem (Q1278268) (← links)
- Reordering strategies for a newsboy-type product (Q1280186) (← links)
- Multi-stage newsboy problem: A dynamic model. (Q1399591) (← links)
- Multiproduct multiperiod newsvendor problem with dynamic market efforts (Q1677739) (← links)
- Optimizing (\(s, S\)) policies for multi-period inventory models with demand distribution uncertainty: robust dynamic programing approaches (Q1753637) (← links)
- Newsvendor problem with clearance pricing (Q1754312) (← links)
- Scheduling parallel machines by the dynamic newsboy problem (Q1765550) (← links)
- Stochastic Stackelberg equilibria with applications to time-dependent newsvendor models (Q1994259) (← links)
- Probability-free solutions to the non-stationary newsvendor problem (Q2259048) (← links)
- A two-product, multi-period nonstationary newsvendor problem with budget constraint (Q2318253) (← links)
- Interdependent demand in the two-period newsvendor problem (Q2338468) (← links)
- The newsboy problem with resalable returns: a single period model and case study (Q2569099) (← links)
- Distribution-free solutions to the extended multi-period newsboy problem (Q2628173) (← links)
- A MULTI-LOCATION NEWSBOY PROBLEM WITH LOST SALE DEPENDS ON HOLDING TIME (Q2966916) (← links)
- Multi-period aggregate production planning in a news-vendor framework (Q3378824) (← links)
- A Note on the Newsboy Problem with an Emergency Supply Option (Q4344436) (← links)
- A semi-analytical solution for a newsboy problem with mid-period replenishment (Q4383677) (← links)
- A binomial decision tree to manage <scp>yield‐uncertainty</scp> in <scp>multi‐round</scp> academic admissions processes (Q6077358) (← links)
