Computing minimal forecast horizons: an integer programming approach
type: Item
instance of: scholarly article
title: Computing minimal forecast horizons: an integer programming approach
zbMATH Open document ID: 1121.90094
author: Srinagesh Gavirneni
author: Sanjeewa Naranpanawe
author: Suresh P. Sethi
author: Milind Dawande
published in: JMMA. Journal of Mathematical Modelling and Algorithms
publication date: 2006-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90B50
zbMATH DE Number: 5073717
describes a project that uses: MINTO
MaRDI profile type: Publication
full work available at URL: s10852-005-9012-3
OpenAlex ID: W3125684993
cites work: A forward algorithm and planning horizon procedure for the production smoothing problem without inventory
cites work: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: A perfect forward procedure for a single facility dynamic location/relocation problem
cites work: Forecast horizons for the discounted dynamic lot-size problem allowing speculative motive
cites work: Q3678942
cites work: Concepts of Forecast and Decision Horizons: Applications to Dynamic Stochastic Optimization Problems
cites work: A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem
cites work: Minimal forecast horizon procedures for dynamic lot size models
cites work: A Perfect Planning Horizon Procedure for a Deterministic Cash Balance Problem
cites work: Planning horizon procedures for machine replacement models with several possible replacement alternatives
cites work: Existence of Forecast Horizons in Undiscounted Discrete-Time Lot Size Models
cites work: Forecast horizons and dynamic facility location planning
cites work: Minimal Forecast Horizons and a New Planning Procedure for the General Dynamic Lot Sizing Model: Nervousness Revisited
cites work: Fast Solution and Detection of Minimal Forecast Horizons in Dynamic Programs with a Single Indicator of the Future: Applications to Dynamic Lot-Sizing Models
cites work: Detection of minimal forecast horizons in dynamic programs with multiple indicators of the future
cites work: A Cutting Plane Algorithm for the Linear Ordering Problem
cites work: Algorithms and Planning Horizon Results for Production Planning Problems with Separable Costs
cites work: Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results
cites work: A model for equipment replacement due to technological obsolescence
cites work: MINTO, a Mixed INTeger Optimizer
cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut
cites work: Forecast horizon in nonstationary Markov decision problems
cites work: Deterministic Capacity Expansion Under Deterioration
cites work: Capacity expansion with alternative technology choices
cites work: Conditions for the existence of decision horizons for discounted problems in a stochastic environment: A note
DOI: 10.1007/S10852-005-9012-3
description: scientific article; zbMATH DE number 5073717