Machine learning for combinatorial optimization: a methodological tour d'horizon
From MaRDI portal
Publication:2029358
DOI10.1016/j.ejor.2020.07.063zbMath1487.90541arXiv1811.06128OpenAlexW3047863327WikidataQ115188538 ScholiaQ115188538MaRDI QIDQ2029358
Andrea Lodi, Antoine Prouvost, Yoshua Bengio
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.06128
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems, A note on no-free-lunch theorem, Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning, Boosting ant colony optimization via solution prediction and machine learning, A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX, Learning the travelling salesperson problem requires rethinking generalization, Generative deep learning for decision making in gas networks, Predicting Tactical Solutions to Operational Planning Problems Under Imperfect Information, JANOS: An Integrated Predictive and Prescriptive Modeling Framework, Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints, Predicting solutions of large-scale optimization problems via machine learning: a case study in blood supply chain management, Reinforcement learning for combinatorial optimization: a survey, Deep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering, Guidelines for the computational testing of machine learning approaches to vehicle routing problems, An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning, BDD-based optimization for the quadratic stable set problem, Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem, Learning to schedule heuristics for the simultaneous stochastic optimization of mining complexes, Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II, Predicting the optimal period for Cyclic Hoist Scheduling Problems, Multi-constructor CMSA for the maximum disjoint dominating sets problem, Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems, Constraint-based robust planning and scheduling of airport apron operations through simheuristics, \textsc{Ner4Opt}: named entity recognition for optimization modelling from natural language, A reinforcement learning approach for transaction scheduling in a shuttle‐based storage and retrieval system, ReLU neural networks of polynomial size for exact maximum flow computation, An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents, A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment, Research trends in combinatorial optimization, Online Mixed-Integer Optimization in Milliseconds, Towards Lower Bounds on the Depth of ReLU Neural Networks, A data driven Dantzig-Wolfe decomposition framework, The first AI4TSP competition: learning to solve stochastic routing problems, A reinforced hybrid genetic algorithm for the traveling salesman problem, Machine learning augmented approaches for hub location problems, Adaptive solution prediction for combinatorial optimization, Navigational guidance -- a deep learning approach, Designing topological data to forecast bankruptcy using convolutional neural networks, gym-flp: a Python package for training reinforcement learning algorithms on facility layout problems, Machine learning-based online scheduling in distributed computing, Tutorial on Amortized Optimization, Targeted configuration of an SMT solver, Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness, Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework, Dynamic graph conv-LSTM model with dynamic positional encoding for the large-scale traveling salesman problem, Tailored presolve techniques in branch‐and‐bound method for fast mixed‐integer optimal control applications, Learning to repeatedly solve routing problems, Catch me if you scan: data-driven prescriptive modeling for smart store environments, Set-to-Sequence Methods in Machine Learning: A Review, Generalization of machine learning for problem reduction: a case study on travelling salesman problems, A novel solution approach with ML-based pseudo-cuts for the flight and maintenance planning problem, Metaheuristics ``In the large, Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art, A comment on: ``What makes a VRP solution good? The generation of problem-specific knowledge for heuristics, Data-driven algorithm selection and tuning in optimization and signal processing, Learning chordal extensions, Beyond graph neural networks with lifted relational neural networks, Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning, Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems, Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem, Reinforcement learning of simplex pivot rules: a proof of concept, Reinforcement learning for the knapsack problem, Neural large neighborhood search for routing problems, Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times, High generalization performance structured self-attention model for knapsack problem, Learning variable activity initialisation for lazy clause generation solvers, Injecting domain knowledge in neural networks: a controlled experiment on a constrained problem, Learning to reduce state-expanded networks for multi-activity shift scheduling, SeaPearl: a constraint programming solver guided by reinforcement learning, Learning to Approximate Industrial Problems by Operations Research Classic Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- ASlib: a benchmark library for algorithm selection
- DASH: dynamic approach for switching heuristics
- Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools
- Generating new test instances by evolving in instance space
- Learning a classification of mixed-integer quadratic programming problems
- Theoretical challenges towards cutting-plane selection
- Markov chain methods for the bipartite Boolean quadratic programming problem
- Learning when to use a decomposition
- Deep learning assisted heuristic tree search for the container pre-marshalling problem
- On learning and branching: a survey
- Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy
- Integer Programming
- Recurrent policy gradients
- Inverse Optimization
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
- A Machine Learning-Based Approximation of Strong Branching
