Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems
From MaRDI portal
Publication:6069740
Cites work
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
- A learn‐and‐construct framework for general mixed‐integer programming problems
- A model‐based heuristic to the vehicle routing and loading problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An ejection chain algorithm for the quadratic assignment problem
- An ejection chain approach for the quadratic multiple knapsack problem
- An exact approach for the vertex coloring problem
- BPPLIB: a library for bin packing and cutting stock problems
- Complementarity formulations of \(\ell_0\)-norm optimization
- Constraint-based very large-scale neighborhood search
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Exploring hyper-heuristic methodologies with genetic programming
- Exploring relaxation induced neighborhoods to improve MIP solutions
- scientific article; zbMATH DE number 4047423 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- Local branching
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- Model-based automatic neighborhood design by unsupervised learning
- Models and bounds for two-dimensional level packing problems
- On the generalized bin packing problem
- Paramils: an automatic algorithm configuration framework
- Sparsity-Promoting Sensor Selection for Non-Linear Measurement Models
- Subgraph ejection chains and tabu search for the crew scheduling problem
- Tuning metaheuristics. A machine learning Perspective
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- Vehicle routing problem with time windows and a limited number of vehicles.
This page was built for publication: Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6069740)
