Learning to Approximate Industrial Problems by Operations Research Classic Problems

References

• Ahmadbeygi S, Cohn A, Lapp M (2010) Decreasing airline delay propagation by re-allocating scheduled slack. IIE Trans. 42(7):478–489.Crossref, Google Scholar
• Aljazzar H, Leue S (2011) K*: A heuristic search algorithm for finding the k shortest paths. Artificial Intelligence 175(18):2129–2154.Crossref, Google Scholar
• Baltean-Lugojan R, Bonami P, Misener R, Tramontani A (2018) Selecting cutting planes for quadratic semidefinite outer-approximation via trained neural networks. Technical report, CPLEX Optimization, IBM.Google Scholar
• Bello I, Pham H, Le QV, Norouzi M, Bengio S (2016) Neural combinatorial optimization with reinforcement learning. Preprint, submitted November 29, https://arxiv.org/abs/1611.09940.Google Scholar
• Bengio Y, Lodi A, Prouvost A (2021) Machine learning for combinatorial optimization: A methodological tour d’horizon. Eur. J. Oper. Res. 290(2):405–421.Google Scholar
• Bertsimas D, Jaillet P, Martin S (2019) Online vehicle routing: The edge of optimization in large-scale applications. Oper. Res. 67(1):143–162.Link, Google Scholar
• Bonami P, Lodi A, Zarpellon G (2018) Learning a classification of mixed-integer quadratic programming problems. Internat. Conf. Integration Constraint Programming, Artificial Intelligence, Oper. Res. (Springer, New York), 595–604.Google Scholar
• Burnham KP, Anderson DR (2002) Model Selection and Multimodel Inference: A Practical Information-Theoretic Approach, 2nd ed. (Springer, New York).Google Scholar
• Crammer K, Singer Y (2001) On the algorithmic implementation of multiclass kernel-based vector machines. J. Machine Learn. Res. 2:265–292.Google Scholar
• Dunbar M, Froyland G, Wu C-L (2012) Robust airline schedule planning: Minimizing propagated delay in an integrated routing and crewing framework. Transportation Sci. 46(2):204–216.Link, Google Scholar
• Dunbar M, Froyland G, Wu C-L (2014) An integrated scenario-based approach for robust aircraft routing, crew pairing and re-timing. Comput. Oper. Res. 45:68–86.Crossref, Google Scholar
• Emami P, Ranka S (2018) Learning permutations with sinkhorn policy gradient. Preprint, submitted May 18, https://arxiv.org/abs/1805.07010.Google Scholar
• Gendreau M, Laporte G, Séguin R (1996a) Stochastic vehicle routing. Eur. J. Oper. Res. 88(1):3–12.Crossref, Google Scholar
• Gendreau M, Laporte G, Séguin R (1996b) A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Oper. Res. 44(3):469–477.Link, Google Scholar
• Ghosal S, Wiesemann W (2020) The distributionally robust chance-constrained vehicle routing problem. Oper. Res. 68(3):716–732.Link, Google Scholar
• Khalil E, Dai H, Zhang Y, Dilkina B, Song L (2017) Learning combinatorial optimization algorithms over graphs. Advances in Neural Information Processing Systems (Curran Associates, Red Hook, NY), 6348–6358.Google Scholar
• Kool W, van Hoof H, Welling M (2018) Attention solves your TSP, approximately. Statistics 1050: 22.Google Scholar
• Kruber M, Lübbecke ME, Parmentier A (2017) Learning when to use a decomposition. Internat. Conf. AI OR Techniques Constraint Programming Combin. Optim. Problems (Springer, Berlin), 202–210.Google Scholar
• Lan S, Clarke J-P, Barnhart C (2006) Planning for robust airline operations: Optimizing aircraft routings and flight departure times to minimize passenger disruptions. Transportation Sci. 40(1):15–28.Link, Google Scholar
• Larsen E, Lachapelle S, Bengio Y, Frejinger E, Lacoste-Julien S, Lodi A (2018) Predicting solution summaries to integer linear programs under imperfect information with machine learning. Preprint, submitted July 31, https://arxiv.org/abs/1807.11876.Google Scholar
• Mahmood R, Babier A, McNiven A, Diamant A, Chan TCY (2018) Automated treatment planning in radiation therapy using generative adversarial networks. Preprint, submitted July 17, https://arxiv.org/abs/1807.06489.Google Scholar
• Nowak A, Villar S, Bandeira AS, Bruna J (2017) A note on learning algorithms for quadratic assignment with graph neural networks. Statistics 1050:22.Google Scholar
• Nowak-Vila A, Bach F, Rudi A (2019) A general theory for structured prediction with smooth convex surrogates. Preprint, submitted February 5, https://arxiv.org/abs/1902.01958.Google Scholar
• Nowozin S, Lampert CH (2011) Structured learning and prediction in computer vision. Foundations Trends Comput. Graphics Vision 6(3–4):185–365.Google Scholar
• Secomandi N, Margot F (2009) Reoptimization approaches for the vehicle-routing problem with stochastic demands. Oper. Res. 57(1):214–230.Link, Google Scholar
• Taskar B, Chatalbashev V, Koller D, Guestrin C (2005) Learning structured prediction models: A large margin approach. Proc. 22nd Internat. Conf. Machine Learn. Association for Computing Machinery (ACM, New York), 896–903.Google Scholar
• Vidal T, Laporte G, Matl P (2019) A concise guide to existing and emerging vehicle routing problem variants. Technical report, Pontifical Catholic University of Rio de Janeiro, Brazil.Google Scholar
• Vinyals O, Fortunato M, Jaitly N (2015) Pointer networks. Advances in Neural Information Processing Systems (MIT Press, Cambridge, MA), 2692–2700.Google Scholar
• Wainwright MJ, Jordan MI (2008) Graphical models, exponential families, and variational inference. Foundations Trends Machine Learn. 1(1–2):1–305.Google Scholar
• Weide O, Ryan D, Ehrgott M (2010) An iterative approach to robust and integrated aircraft routing and crew scheduling. Comput. Oper. Res. 37(5):833–844.Crossref, Google Scholar
• Wieschollek P (2016) Cpp optimization library. Accessed February 8, 2021, https://github.com/PatWie/CppNumericalSolvers.Google Scholar