Learning when to use a decomposition
DOI10.1007/978-3-319-59776-8_16zbMATH Open1489.68253OpenAlexW2617704759MaRDI QIDQ2011591FDOQ2011591
Authors: Markus Kruber, Marco E. Lübbecke, Axel Parmentier 
Publication date: 4 August 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-59776-8_16
Recommendations
- A data driven Dantzig-Wolfe decomposition framework
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- Computational evaluation of data driven local search for MIP decompositions
- Random sampling and machine learning to understand good decompositions
- Partial convexification of general mips by Dantzig-Wolfe reformulation
supervised learningcolumn generationmixed-integer programmingbranch-and-priceautomatic Dantzig-Wolfe decomposition
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mixed integer programming (90C11)
Cites Work
- SCIP: solving constraint integer programs
- Scikit-learn: machine learning in Python
- Random Forests and Adaptive Nearest Neighbors
- 10.1162/15324430260185646
- A machine learning-based approximation of strong branching
- Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
Cited In (28)
- Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Learning to sample initial solution for solving 0-1 discrete optimization problem by local search
- Automatic MILP Solver configuration by learning problem similarities
- Adaptive solution prediction for combinatorial optimization
- Learning optimal solutions via an LSTM-optimization framework
- Comments on: ``On learning and branching: a survey
- Machine learning meets mathematical optimization to predict the optimal production of offshore wind parks
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
- Towards Lower Bounds on the Depth of ReLU Neural Networks
- Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints
- Deep learning assisted heuristic tree search for the container pre-marshalling problem
- Theoretical challenges towards cutting-plane selection
- A data driven Dantzig-Wolfe decomposition framework
- Predicting solutions of large-scale optimization problems via machine learning: a case study in blood supply chain management
- Data-driven algorithm selection and tuning in optimization and signal processing
- Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem
- Learning to repeatedly solve routing problems
- Learning to Approximate Industrial Problems by Operations Research Classic Problems
- Online learning for scheduling MIP heuristics
- Deep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering
- The voice of optimization
- Learning to steer nonlinear interior-point methods
- Decomposition Branching for Mixed Integer Programming
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- An attention model for the formation of collectives in real-world domains
- A decomposition heuristic for mixed-integer supply chain problems
- Machine learning augmented approaches for hub location problems
Uses Software
This page was built for publication: Learning when to use a decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011591)
