Pages that link to "Item:Q342297"

The following pages link to Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization (Q342297):

Displaying 20 items.

• Finding happiness: an analysis of the maximum happy vertices problem (Q1634084) (← links)
• A two-step gradient estimation approach for setting supply chain operating parameters (Q1651591) (← links)
• The weighted independent domination problem: integer linear programming models and metaheuristic approaches (Q1681137) (← links)
• ILP-based reduced variable neighborhood search for large-scale minimum common string partition (Q1791896) (← links)
• The maximum happy induced subgraph problem: bounds and algorithms (Q2026981) (← links)
• A comparative analysis of two matheuristics by means of merged local optima networks (Q2029302) (← links)
• Generalized relax-and-fix heuristic (Q2108128) (← links)
• A simple and effective algorithm for the maximum happy vertices problem (Q2121620) (← links)
• Heuristic and exact algorithms for minimum-weight non-spanning arborescences (Q2189916) (← links)
• Generalization of machine learning for problem reduction: a case study on travelling salesman problems (Q2241908) (← links)
• A two-phase approach for single container loading with weakly heterogeneous boxes (Q2312435) (← links)
• MineReduce: an approach based on data mining for problem size reduction (Q2664324) (← links)
• Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When? (Q3304189) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• On the role of metaheuristic optimization in bioinformatics (Q6056877) (← links)
• Multi-constructor CMSA for the maximum disjoint dominating sets problem (Q6065657) (← links)
• Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems (Q6069740) (← links)
• Minimum common string partition: on solving large‐scale problem instances (Q6088232) (← links)
• Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints (Q6088241) (← links)
• Hybridizations of evolutionary algorithms with large neighborhood search (Q6158769) (← links)