Exact and heuristic algorithms for data sets reconstruction

DOI10.1016/S0377-2217(99)00124-1zbMath0960.90089OpenAlexW1991649210MaRDI QIDQ1576347

Daniele Vigo, Andrea Lodi, Cinzia Zannoni

Publication date: 20 May 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00124-1

zbMATH Keywords

heuristicsdynamic programmingbiomedical applications

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Mathematical biology in general (92B99)

Cites Work

• The art and theory of dynamic programming
• An algorithm for the resource constrained shortest path problem
• Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results
• Existence of Forecast Horizons in Undiscounted Discrete-Time Lot Size Models
• Unnamed Item
• Unnamed Item
• Unnamed Item