Solving mixed integer programs using neural networks

V Nair, S Bartunov, F Gimeno, I Von Glehn… - arXiv preprint arXiv …, 2020 - arxiv.org
… new learning-based approach to generating highprocedure begins again. This algorithm
is referred to as branch-and-bound. Linear programming is a main workhorse of this procedure, …

Neural large neighborhood search for the capacitated vehicle routing problem

A Hottung, K Tierney - ECAI 2020, 2020 - ebooks.iospress.nl
large neighborhood search (LNS) framework for vehicle routing that integrates learned
heuristics for generating new solutions. The learning … sophisticated high level search procedure. …

Strong mixed-integer programming formulations for trained neural networks

R Anderson, J Huchette, W Ma… - … Programming, 2020 - Springer
… simple nonlinear activation function that is fixed before training, and \(w^{i,j}\… training
procedure. In its simplest and most common form, the activation function would be the rectified linear

Offline multi-action policy learning: Generalization and optimization

Z Zhou, S Athey, S Wager - Operations Research, 2023 - pubsonline.informs.org
… the policy is restricted to take the form of a decision tree. We propose two different approaches:
one using a mixed integer program formulation and the other using a tree-search based …

Presolve reductions in mixed integer programming

T Achterberg, RE Bixby, Z Gu… - INFORMS Journal …, 2020 - pubsonline.informs.org
… al. 2005), where potentially a large fraction of the variables are fixed before then calling the
MIP solver recursively as part of a procedure for finding improved integer feasible solutions. …

Learning to schedule job-shop problems: representation and policy learning using graph neural network and reinforcement learning

J Park, J Chun, SH Kim, Y Kim… - International journal of …, 2021 - Taylor & Francis
… to learn to schedule a job-shop problem (JSSP) using a graph neural network (GNN) and
reinforcement learning (… framework employs a GNN to learn that node features that embed the …

Learning to solve large-scale security-constrained unit commitment problems

ÁS Xavier, F Qiu, S Ahmed - INFORMS Journal on …, 2021 - pubsonline.informs.org
… on a combination of mixed-integer linear programming (MILP) and machine learning (ML),
to … the first iteration of the procedure may significantly slow down the MIP optimization time. …

Learning improvement heuristics for solving routing problems

Y Wu, W Song, Z Cao, J Zhang… - … networks and learning …, 2021 - ieeexplore.ieee.org
… automatically learn high-quality solution picking policies that … , ie, the solution picked by the
policy will always be accepted, to … , our method can learn high-quality policies that outperform …

Reinforcement learning for combinatorial optimization: A survey

N Mazyavkina, S Sviridov, S Ivanov… - Computers & Operations …, 2021 - Elsevier
… by considering mixed-integer linear programs (MILP) … policy of an agent is and what is the
optimal policy. Here we will deep-dive into the RL algorithms that search for the optimal policy

An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots

C Chen, E Demir, Y Huang - European journal of operational research, 2021 - Elsevier
… The time window in this study is considered to be hard. This means that the delivery can …
We begin with providing the overall procedure of the ALNS used in this paper. Then, we discuss …