Learning to Approximate Industrial Problems by Operations Research Classic Problems
From MaRDI portal
Recommendations
- Fast Continuous and Integer L-Shaped Heuristics Through Supervised Learning
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Predicting Tactical Solutions to Operational Planning Problems Under Imperfect Information
- Learning to repeatedly solve routing problems
- A machine learning-based approximation of strong branching
Cites work
- 10.1162/15324430260185628
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- An integrated scenario-based approach for robust aircraft routing, crew pairing and re-timing
- An iterative approach to robust and integrated aircraft routing and crew scheduling
- Graphical models, exponential families, and variational inference
- K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths
- Learning a classification of mixed-integer quadratic programming problems
- Learning when to use a decomposition
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Model Selection and Multimodel Inference
- Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
- Stochastic vehicle routing
- Structured Learning and Prediction in Computer Vision
- The distributionally robust chance-constrained vehicle routing problem
Cited in
(4)- Predicting Tactical Solutions to Operational Planning Problems Under Imperfect Information
- Fast Continuous and Integer L-Shaped Heuristics Through Supervised Learning
- Learning from the aggregated optimum: managing port wine inventory in the face of climate risks
- A machine learning approach to rank pricing problems in branch-and-price
This page was built for publication: Learning to Approximate Industrial Problems by Operations Research Classic Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5031031)
