Learning optimal solutions via an LSTM-optimization framework
From MaRDI portal
Publication:6168346
DOI10.1007/s43069-023-00224-5arXiv2207.02937MaRDI QIDQ6168346
İ. Esra Büyüktahtakın, Dogacan Yilmaz
Publication date: 8 August 2023
Published in: SN Operations Research Forum (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.02937
mixed integer programmingrecurrent neural networksmachine learningsequential decision-makingcapacitated lot-sizingbidirectional long short term memory (LSTM)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic programming approximation algorithms for the capacitated lot-sizing problem
- Supervised sequence labelling with recurrent neural networks.
- Capacitated lot-sizing with extensions: a review
- Learning a classification of mixed-integer quadratic programming problems
- Partial objective inequalities for the multi-item capacitated lot-sizing problem
- Machine learning meets mathematical optimization to predict the optimal production of offshore wind parks
- A study of the lot-sizing polytope
- Learning when to use a decomposition
- Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs
- Simultaneous lotsizing and scheduling problems: a classification and review of models
- On learning and branching: a survey
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Production Planning of Style Goods with High Setup Costs and Forecast Revisions
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Deterministic Production Planning: Algorithms and Complexity
- Computational Complexity of the Capacitated Lot Size Problem
- Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
- Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
- Predicting Tactical Solutions to Operational Planning Problems Under Imperfect Information
- Online Mixed-Integer Optimization in Milliseconds
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
- Production Planning by Mixed Integer Programming
- Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems
