Model-based automatic neighborhood design by unsupervised learning
From MaRDI portal
Recommendations
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Characterization and Automation of Matching-Based Neighborhoods
- Adaptive large neighborhood search for mixed integer programming
- Variable neighborhood search and local branching
Cites work
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- A survey of very large-scale neighborhood search techniques
- Bounding, filtering and diversification in CP-based local branching
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Exploring relaxation induced neighborhoods to improve MIP solutions
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- Integer Programming Formulation of Traveling Salesman Problems
- Local branching
- New convergent heuristics for 0-1 mixed integer programming
- Repairing MIP infeasibility through local branching
- Solution of a Large-Scale Traveling-Salesman Problem
- TSPLIB—A Traveling Salesman Problem Library
- The vehicle routing problem
- Variable neighborhood search and local branching
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
Cited in
(5)- Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- A learn‐and‐construct framework for general mixed‐integer programming problems
- How to Update Neighborhood Models
- Characterization and Automation of Matching-Based Neighborhoods
This page was built for publication: Model-based automatic neighborhood design by unsupervised learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337347)
