Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
DOI10.1016/J.COR.2015.10.014zbMATH Open1349.90705OpenAlexW1899797054MaRDI QIDQ342297FDOQ342297
José A. Lozano, Manuel López-Ibáñez, Pedro Pinacho, Christian Blum
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://www.research.manchester.ac.uk/portal/en/publications/construct-merge-solve--adapt-a-new-general-algorithm-for-combinatorial-optimization(b1d35339-7263-4409-9f5b-fe9593b315f7).html
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
metaheuristicshybrid algorithmsexact solverminimum common string partitionminimum covering arborescence
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Algorithms on Strings, Trees and Sequences
- Algorithms and Computation
- Graph theory. Foreword by Crispin St. J. A. Nash-Williams.
- Title not available (Why is that?)
- Decomposition based hybrid metaheuristics
- Mathematical programming strategies for solving the minimum common string partition problem
- Tour merging via branch-decomposition
- Quick Greedy Computation for Minimum Common String Partitions
- A Hybrid Optimization Framework for Cutting and Packing Problems
- Minimum‐weight rooted not‐necessarily‐spanning arborescence problem
- Models and heuristics for a minimum arborescence problem
- Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set
- Computing a longest common subsequence for a set of strings
Cited In (24)
- Generalized relax-and-fix heuristic
- Application of Adapt-CMSA to the two-echelon electric vehicle routing problem with simultaneous pickup and deliveries
- Hybridizations of evolutionary algorithms with large neighborhood search
- Progressively strengthening and tuning MIP solvers for reoptimization
- Finding happiness: an analysis of the maximum happy vertices problem
- Simple heuristics for the rooted max tree coverage problem
- The maximum happy induced subgraph problem: bounds and algorithms
- A comparative analysis of two matheuristics by means of merged local optima networks
- Minimum common string partition: on solving large‐scale problem instances
- Matheuristics: survey and synthesis
- On the role of metaheuristic optimization in bioinformatics
- Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems
- A simple and effective algorithm for the maximum happy vertices problem
- Multi-constructor CMSA for the maximum disjoint dominating sets problem
- A two-step gradient estimation approach for setting supply chain operating parameters
- A two-phase approach for single container loading with weakly heterogeneous boxes
- MineReduce: an approach based on data mining for problem size reduction
- ILP-based reduced variable neighborhood search for large-scale minimum common string partition
- Integer linear programming models and greedy heuristic for the minimum weighted independent dominating set problem
- Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When?
- The weighted independent domination problem: integer linear programming models and metaheuristic approaches
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences
- Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints
- Generalization of machine learning for problem reduction: a case study on travelling salesman problems
Uses Software
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)
