An evolutionary algorithm based hyper-heuristic framework for the set packing problem
DOI10.1016/j.ins.2019.07.073zbMath1456.90177OpenAlexW2963809395WikidataQ127437836 ScholiaQ127437836MaRDI QIDQ2656742
Joong Hoon Kim, Sachchida Nand Chaurasia
Publication date: 16 March 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://qmro.qmul.ac.uk/xmlui/handle/123456789/59106
heuristicset packing problemestimation of distribution algorithmhyper-heuristicguided-mutationminimum weight dominating set problem
Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hybrid evolutionary approach for set packing problem
- An iterated multi-stage selection hyper-heuristic
- An order-based algorithm for minimum dominating set with application in graph mining
- A method for the cutting stock problem with different qualities
- GRASP for set packing problems.
- The path set packing problem
- A fast approximation algorithm for solving the complete set packing problem
- A dynamic programming algorithm for tree-like weighted set packing problem
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
- A GRASP with path-relinking for private virtual circuit routing
- An efficient parameterized algorithm for m-set packing
- On the facial structure of set packing polyhedra
- Large Neighborhood Local Search for the Maximum Set Packing Problem
- A set packing model for the ground holding problem in congested networks
This page was built for publication: An evolutionary algorithm based hyper-heuristic framework for the set packing problem
