Learning when to use a decomposition

DOI10.1007/978-3-319-59776-8_16zbMath1489.68253OpenAlexW2617704759MaRDI QIDQ2011591

Marco E. Lübbecke, Markus Kruber, Axel Parmentier

Publication date: 4 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-59776-8_16

zbMATH Keywords

column generationsupervised learningbranch-and-pricemixed-integer programmingautomatic Dantzig-Wolfe decomposition

Mathematics Subject Classification ID

Mixed integer programming (90C11) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (26)

Theoretical challenges towards cutting-plane selection ⋮ Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets ⋮ Learning to steer nonlinear interior-point methods ⋮ 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 ⋮ Deep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering ⋮ Decomposition Branching for Mixed Integer Programming ⋮ A decomposition heuristic for mixed-integer supply chain problems ⋮ Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem ⋮ Online learning for scheduling MIP heuristics ⋮ Towards Lower Bounds on the Depth of ReLU Neural Networks ⋮ A data driven Dantzig-Wolfe decomposition framework ⋮ Machine learning augmented approaches for hub location problems ⋮ Adaptive solution prediction for combinatorial optimization ⋮ Learning optimal solutions via an LSTM-optimization framework ⋮ Learning to repeatedly solve routing problems ⋮ Machine learning meets mathematical optimization to predict the optimal production of offshore wind parks ⋮ An attention model for the formation of collectives in real-world domains ⋮ 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 ⋮ Data-driven algorithm selection and tuning in optimization and signal processing ⋮ The voice of optimization ⋮ Deep learning assisted heuristic tree search for the container pre-marshalling problem ⋮ Comments on: ``On learning and branching: a survey ⋮ Learning to Approximate Industrial Problems by Operations Research Classic Problems

Uses Software

• MIPLIB
• Scikit
• GCG
• Unnamed Item

Cites Work

• Unnamed Item
• SCIP: solving constraint integer programs
• Automatic Dantzig-Wolfe reformulation of mixed integer programs
• 10.1162/15324430260185646
• Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization
• A Machine Learning-Based Approximation of Strong Branching
• Random Forests and Adaptive Nearest Neighbors

This page was built for publication: Learning when to use a decomposition