Computing minimal forecast horizons: an integer programming approach
From MaRDI portal
Recommendations
- Forecast Horizons for a Class of Dynamic Lot-Size Problems Under Discrete Future Demand
- Fast Solution and Detection of Minimal Forecast Horizons in Dynamic Programs with a Single Indicator of the Future: Applications to Dynamic Lot-Sizing Models
- Minimal Forecast Horizons and a New Planning Procedure for the General Dynamic Lot Sizing Model: Nervousness Revisited
- Minimal forecast horizon procedures for dynamic lot size models
- Detection of minimal forecast horizons in dynamic programs with multiple indicators of the future
Cites work
- scientific article; zbMATH DE number 3900467 (Why is no real title available?)
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A Perfect Planning Horizon Procedure for a Deterministic Cash Balance Problem
- A forward algorithm and planning horizon procedure for the production smoothing problem without inventory
- A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem
- A model for equipment replacement due to technological obsolescence
- A perfect forward procedure for a single facility dynamic location/relocation problem
- Algorithms and Planning Horizon Results for Production Planning Problems with Separable Costs
- Branch-and-price: Column generation for solving huge integer programs
- Capacity expansion with alternative technology choices
- Concepts of Forecast and Decision Horizons: Applications to Dynamic Stochastic Optimization Problems
- Conditions for the existence of decision horizons for discounted problems in a stochastic environment: A note
- Detection of minimal forecast horizons in dynamic programs with multiple indicators of the future
- Deterministic Capacity Expansion Under Deterioration
- Existence of Forecast Horizons in Undiscounted Discrete-Time Lot Size Models
- Fast Solution and Detection of Minimal Forecast Horizons in Dynamic Programs with a Single Indicator of the Future: Applications to Dynamic Lot-Sizing Models
- Forecast horizon in nonstationary Markov decision problems
- Forecast horizons and dynamic facility location planning
- Forecast horizons for the discounted dynamic lot-size problem allowing speculative motive
- MINTO, a Mixed INTeger Optimizer
- Minimal Forecast Horizons and a New Planning Procedure for the General Dynamic Lot Sizing Model: Nervousness Revisited
- Minimal forecast horizon procedures for dynamic lot size models
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results
- Planning horizon procedures for machine replacement models with several possible replacement alternatives
Cited in
(5)- Forecast horizon for dynamic lot sizing model under product substitution and perishable inventories
- Efficient approximate algorithms for a class of dynamic lot size problems under product substitution
- Forecast Horizons for a Class of Dynamic Lot-Size Problems Under Discrete Future Demand
- Dynamic lot-sizing model under perishability, substitution, and limited storage capacity
- Forecast horizon of dynamic lot size model for perishable inventory with minimum order quantities
This page was built for publication: Computing minimal forecast horizons: an integer programming approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853795)
