Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
From MaRDI portal
(Redirected from Publication:342297)
Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
Recommendations
- Construct, merge, solve and adapt: application to the repetition-free longest common subsequence problem
- A comparative analysis of two matheuristics by means of merged local optima networks
- Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems
- ILP-based reduced variable neighborhood search for large-scale minimum common string partition
- Exact Algorithms for Generalized Combinatorial Optimization Problems
Cites work
- scientific article; zbMATH DE number 3470175 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Hybrid Optimization Framework for Cutting and Packing Problems
- Algorithms and Computation
- Algorithms on Strings, Trees and Sequences
- Computing a longest common subsequence for a set of strings
- Decomposition based hybrid metaheuristics
- Graph theory. Foreword by Crispin St. J. A. Nash-Williams.
- Mathematical programming strategies for solving the minimum common string partition problem
- Minimum‐weight rooted not‐necessarily‐spanning arborescence problem
- Models and heuristics for a minimum arborescence problem
- Quick greedy computation for minimum common string partitions
- Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set
- Tour merging via branch-decomposition
Cited in
(26)- Finding happiness: an analysis of the maximum happy vertices problem
- Progressively strengthening and tuning MIP solvers for reoptimization
- Application of Adapt-CMSA to the two-echelon electric vehicle routing problem with simultaneous pickup and deliveries
- A simple and effective algorithm for the maximum happy vertices problem
- Multi-constructor CMSA for the maximum disjoint dominating sets problem
- MineReduce: an approach based on data mining for problem size reduction
- The maximum happy induced subgraph problem: bounds and algorithms
- A comparative analysis of two matheuristics by means of merged local optima networks
- Simple heuristics for the rooted max tree coverage problem
- A two-step gradient estimation approach for setting supply chain operating parameters
- Hybridizations of evolutionary algorithms with large neighborhood search
- Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints
- Generalized relax-and-fix heuristic
- Minimum common string partition: on solving large‐scale problem instances
- Matheuristics: survey and synthesis
- On the role of metaheuristic optimization in bioinformatics
- Generalization of machine learning for problem reduction: a case study on travelling salesman problems
- The weighted independent domination problem: integer linear programming models and metaheuristic approaches
- Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional knapsack problem: which one works better when?
- Construct, merge, solve and adapt: application to the repetition-free longest common subsequence problem
- Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences
- Integer linear programming models and greedy heuristic for the minimum weighted independent dominating set problem
- A two-phase approach for single container loading with weakly heterogeneous boxes
- ILP-based reduced variable neighborhood search for large-scale minimum common string partition
- Program trace optimization with constructive heuristics for combinatorial problems
This page was built for publication: Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342297)
