A comparative analysis of two matheuristics by means of merged local optima networks
From MaRDI portal
Publication:2029302
Recommendations
- Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional knapsack problem: which one works better when?
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Construct, merge, solve and adapt: application to the repetition-free longest common subsequence problem
- scientific article; zbMATH DE number 1961991
- Adaptive large neighborhood search for mixed integer programming
Cites work
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- A large neighborhood search heuristic for supply chain network design
- A two-phase approach for single container loading with weakly heterogeneous boxes
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- Algorithms and Computation
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Approximation schemes for a class of subset selection problems
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional knapsack problem: which one works better when?
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Handbook of metaheuristics
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Hybrid large neighborhood search for the bus rapid transit route design problem
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Kernel search: an application to the index tracking problem
- Local branching
- Mathematical programming strategies for solving the minimum common string partition problem
- Minimum common string partition: on solving large‐scale problem instances
- POPMUSIC as a matheuristic for the berth allocation problem
- Record breaking optimization results using the ruin and recreate principle
- Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
- Tour merging via branch-decomposition
- Variable neighborhood search: Principles and applications
Cited in
(4)- Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional knapsack problem: which one works better when?
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Multi-constructor CMSA for the maximum disjoint dominating sets problem
- An auxiliary hybrid heuristic approach for objective function design evaluation -- using train unit scheduling as an example
This page was built for publication: A comparative analysis of two matheuristics by means of merged local optima networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029302)
