Sequential design with applications to the trim-loss problem

DOI10.1080/00207549608904934zbMath0926.90040OpenAlexW2075854346MaRDI QIDQ4230103

R. D. Dietrich, Sidney Yakowitz

Publication date: 1 March 1999

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207549608904934

zbMATH Keywords

trim-loss problemnonparametric sequential designon-line heuristic rule selection

Mathematics Subject Classification ID

Production models (90B30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonparametric bandit methods
• Asymptotically efficient adaptive allocation rules
• Machine learning for optimal blackjack counting strategies
• A statistical foundation for machine learning, with application to Go- Moku
• The time until the final zero crossing of random sums with application to nonparametric bandit theory
• Adaptive Markov control processes
• A Linear Programming Approach to the Cutting-Stock Problem
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Automatic Learning for Dynamic Markov Fields with Application to Epidemiology
• Theory for automatic learning under partially observed Markov-dependent noise
• An Algorithm for Two-Dimensional Cutting Problems
• Random Search in the Presence of Noise, with Application to Machine Learning
• Methods and theory for off-line machine learning
• Machine learning and nonparametric bandit theory
• Multistage Cutting Stock Problems of Two and More Dimensions
• Some aspects of the sequential design of experiments