Similar Search Results

The linear dynamic lot size problem with minimum order quantity

Okhrin, Irena; Richter, Knut - In: International journal of production economics 133 (2011) 2, pp. 688-693

Persistent link: https://www.econbiz.de/10009299854

Time Series Forecasting With a Learning Algorithm : An Approximate Dynamic Programming Approach

Collado, Ricardo - 2019

We consider the basic problem of refi tting a time series over a finite period of time and formulate it as a stochastic dynamic program. By changing the underlying Markov decision process we are able to obtain a model that at optimality considers historical data as well as forecasts of future...

Persistent link: https://www.econbiz.de/10012894079

A Primal-dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint

Chen, Ningyuan - 2020

each type and attempts to maximize the revenue over the season. We provide a learning algorithm that is near-optimal when … the demand and capacity scale in proportion. The algorithm utilizes the primal-dual formulation of the problem and learns … the dual optimal solution explicitly. It allows the algorithm to overcome the curse of dimensionality (the rate of regret …

Persistent link: https://www.econbiz.de/10012850644

Online allocation and pricing : constant regret via Bellman inequalities

Vera, Alberto; Banerjee, Siddartha; Gurvich, Itai - In: Operations research 69 (2021) 3, pp. 821-840

Persistent link: https://www.econbiz.de/10012546874

An iterative dynamic programming approach for the temporal knapsack problem

Clautiaux, François; Detienne, Boris; Guillot, Geal - In: European journal of operational research : EJOR 293 (2021) 2, pp. 442-456

Persistent link: https://www.econbiz.de/10012513190

Approximate dynamic programming for an energy-efficient parallel machine scheduling problem

Heydar, Mojtaba; Mardaneh, Elham; Loxton, Ryan - In: European journal of operational research : EJOR 302 (2022) 1, pp. 363-380

Persistent link: https://www.econbiz.de/10013269762

Comparison of anticipatory algorithms for a dial-a-ride problem

Ritzinger, Ulrike; Puchinger, Jakob; Rudloff, Christian; … - In: European journal of operational research : EJOR 301 (2022) 2, pp. 591-608

Persistent link: https://www.econbiz.de/10013207664

Discrete multi-module capacitated lot-sizing problems with multiple items

Kulkarni, Kartik; Bansal, Manish - In: Operations research letters 50 (2022) 2, pp. 168-175

Persistent link: https://www.econbiz.de/10013192673

An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization

Pfeiffer, Christian; Schulz, Arne - In: OR spectrum : quantitative approaches in management 44 (2022) 1, pp. 87-119

Persistent link: https://www.econbiz.de/10013172669

Efficient algorithms for the joint replenishment problem with minimum order quantities

Muriel, Ana; Chugh, Tammana; Prokle, Michael - In: European journal of operational research : EJOR 300 (2022) 1, pp. 137-150

Persistent link: https://www.econbiz.de/10013173839