Learning structured approximations of combinatorial optimization problems

Lipschitzian optimization without the Lipschitz constant

D. R. Jones, C. D. Perttunen, and B. E. Stuckman · 1993

Earlier work this paper cites.

A recovering beam search algorithm for the one-machine dynamic total completion time scheduling problem

F. Della Croce and V. T’kindt · 2002

Earlier work this paper cites.

Introduction to Statistical Learning Theory

Olivier Bousquet, Stéphane Boucheron, and Gábor Lugosi · 2004

Earlier work this paper cites.

Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation

Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, and Olivier Spanjaard · 2010

Earlier work this paper cites.

Structured Learning and Prediction in Computer Vision

Sebastian Nowozin · 2010

Earlier work this paper cites.

Mathematical Foundations of Supervised Learning

Michael M. Wolf · 2018

Earlier work this paper cites.

Machine learning for combinatorial optimization: A methodological tour d’horizon

Yoshua Bengio, Andrea Lodi, and Antoine Prouvost · 2020

Cited alongside, same era.

Learning with differentiable pertubed optimizers

Quentin Berthet, Mathieu Blondel, Olivier Teboul, Marco Cuturi, Jean-Philippe Vert, and Francis R. Bach · 2020

Cited alongside, same era.

Smart predict-and-optimize for hard combinatorial optimization problems

Jayanta Mandi, Peter J Stuckey, Tias Guns, et al · 2020

Cited alongside, same era.

Geometric deep learning: Grids, groups, graphs, geodesics, and gauges

Original

Michael M Bronstein, Joan Bruna, Taco Cohen, and Petar Veličković · 2021

Cited alongside, same era.

Smart “Predict, then Optimize”

Adam N. Elmachtoub and Paul Grigas · 2021

Cited alongside, same era.

The NLopt nonlinear-optimization package

End-to-End Constrained Optimization Learning: A Survey

James Kotary, Ferdinando Fioretto, Pascal Van Hentenryck, and Bryan Wilder · 2021

Closest in time.

Learning to solve the single machine scheduling problem with release times and sum of completion times

Original

Axel Parmentier and Vincent T’Kindt · 2021

Closest in time.

Efficient and Modular Implicit Differentiation

Mathieu Blondel, Quentin Berthet, Marco Cuturi, Roy Frostig, Stephan Hoyer, Felipe Llinares-López, Fabian Pedregosa, and Jean-Philippe Vert · 2022

Closest in time.

Learning with Combinatorial Optimization Layers: A Probabilistic Approach, July 2022

Guillaume Dalle, Léo Baty, Louis Bouvier, and Axel Parmentier · 2022

Closest in time.

Learning to Approximate Industrial Problems by Operations Research Classic Problems

Axel Parmentier · 2094

Closest in time.