Learning when to use a decomposition
From MaRDI portal
Publication:2011591
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
Cites work
- 10.1162/15324430260185646
- A machine learning-based approximation of strong branching
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization
- Random Forests and Adaptive Nearest Neighbors
- SCIP: solving constraint integer programs
- Scikit-learn: machine learning in Python
Cited in
(31)- Automatic MILP Solver configuration by learning problem similarities
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
- Deep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering
- Learning-based branch-and-price algorithms for the vehicle routing problem with time windows and two-dimensional loading constraints
- A data driven Dantzig-Wolfe decomposition framework
- Ranking Constraint Relaxations for Mixed Integer Programs Using a Machine Learning Approach
- Data-driven algorithm selection and tuning in optimization and signal processing
- Predicting solutions of large-scale optimization problems via machine learning: a case study in blood supply chain management
- An attention model for the formation of collectives in real-world domains
- Adaptive solution prediction for combinatorial optimization
- Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets
- Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem
- The voice of optimization
- Learning optimal solutions via an LSTM-optimization framework
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- Random sampling and machine learning to understand good decompositions
- Comments on: ``On learning and branching: a survey
- Learning to Approximate Industrial Problems by Operations Research Classic Problems
- Machine learning augmented approaches for hub location problems
- Towards Lower Bounds on the Depth of ReLU Neural Networks
- Learning to repeatedly solve routing problems
- Learning to steer nonlinear interior-point methods
- Deep learning assisted heuristic tree search for the container pre-marshalling problem
- Decomposition Branching for Mixed Integer Programming
- Theoretical challenges towards cutting-plane selection
- Learning to sample initial solution for solving 0-1 discrete optimization problem by local search
- Machine learning meets mathematical optimization to predict the optimal production of offshore wind parks
- Computational evaluation of data driven local search for MIP decompositions
- Online learning for scheduling MIP heuristics
- A decomposition heuristic for mixed-integer supply chain problems
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)
