Learning to Approximate Industrial Problems by Operations Research Classic Problems
From MaRDI portal
Publication:5031031
DOI10.1287/opre.2020.2094OpenAlexW2994967491MaRDI QIDQ5031031
Publication date: 18 February 2022
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2020.2094
optimizationcolumn generationmatheuristicpath problemstructured learningmachine learning for operations researchstochastic vehicle scheduling problem
Uses Software
Cites Work
- An integrated scenario-based approach for robust aircraft routing, crew pairing and re-timing
- K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths
- An iterative approach to robust and integrated aircraft routing and crew scheduling
- Stochastic vehicle routing
- 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
- Structured Learning and Prediction in Computer Vision
- 10.1162/15324430260185628
- Graphical Models, Exponential Families, and Variational Inference
- Model Selection and Multimodel Inference
- The Distributionally Robust Chance-Constrained Vehicle Routing Problem
- Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
This page was built for publication: Learning to Approximate Industrial Problems by Operations Research Classic Problems
