MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
From MaRDI portal
Recommendations
- Model-based automatic neighborhood design by unsupervised learning
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Adaptive large neighborhood search for mixed integer programming
- Optimal decision trees for feature based parameter tuning: integer programming model and VNS heuristic
- Characterization and Automation of Matching-Based Neighborhoods
Cites work
- scientific article; zbMATH DE number 4047423 (Why is no real title available?)
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- A feasibility pump heuristic for general mixed-integer problems
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Bounding, filtering and diversification in CP-based local branching
- Constraint-based very large-scale neighborhood search
- Exploring hyper-heuristic methodologies with genetic programming
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Feasibility pump 2.0
- Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- Improving the feasibility pump
- Integer Programming Formulation of Traveling Salesman Problems
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Kernel search: a new heuristic framework for portfolio selection
- Kernel search: an application to the index tracking problem
- Local branching
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming
- Measuring instance difficulty for combinatorial optimization problems
- Model-based automatic neighborhood design by unsupervised learning
- TSPLIB—A Traveling Salesman Problem Library
- The feasibility pump
- Tuning metaheuristics. A machine learning Perspective
- Variable neighborhood search and local branching
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- Vehicle Routing
Cited in
(7)- Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints
- A novel solution approach with ML-based pseudo-cuts for the flight and maintenance planning problem
- Detecting semantic groups in MIP models
- Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems
- A learn‐and‐construct framework for general mixed‐integer programming problems
- Model-based automatic neighborhood design by unsupervised learning
- Characterization and Automation of Matching-Based Neighborhoods
This page was built for publication: MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652297)
