A hybrid evolutionary approach for set packing problem

DOI10.1007/S12597-014-0184-3zbMath1332.90223OpenAlexW2016717119MaRDI QIDQ260677

Alok Singh, Shyam Sundar, Sachchida Nand Chaurasia

Publication date: 22 March 2016

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-014-0184-3

zbMATH Keywords

constrained optimizationevolutionary algorithmsestimation of distribution algorithmsguided mutationset packing problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (3)

Solving the set packing problem via a maximum weighted independent set heuristic ⋮ An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks ⋮ An evolutionary algorithm based hyper-heuristic framework for the set packing problem

Cites Work

• Unnamed Item
• A method for the cutting stock problem with different qualities
• GRASP for set packing problems.
• An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
• Routing Trains Through Railway Stations: Model Formulation and Algorithms
• On the facial structure of set packing polyhedra
• A set packing model for the ground holding problem in congested networks

This page was built for publication: A hybrid evolutionary approach for set packing problem