Solving the set packing problem via a maximum weighted independent set heuristic

DOI10.1155/2020/3050714zbMath1459.90186OpenAlexW3111113712MaRDI QIDQ826368

Dantong Ouyang, Yupan Wang, Ruizhi Li, Jianhua Jiang, Shuli Hu, Minghao Yin

Publication date: 4 January 2021

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/3050714

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• CCASat
• SCCWalk

Cites Work

• Unnamed Item
• Unnamed Item
• A hybrid evolutionary approach for set packing problem
• Alternative formulations for the set packing problem and their application to the winner determination problem
• Local search for Boolean satisfiability with configuration checking and subscore
• Local search with edge weighting and configuration checking heuristics for minimum vertex cover
• On a posterior evaluation of a simple greedy method for set packing
• A method for the cutting stock problem with different qualities
• GRASP for set packing problems.
• Routing trains through a railway station based on a node packing model
• An efficient local search framework for the minimum weighted vertex cover problem
• SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
• A new approach for modeling and solving set packing problems
• Heuristics for a bidding problem
• An evolutionary algorithm based hyper-heuristic framework for the set packing problem
• Greedy Local Improvement and Weighted Set Packing Approximation
• A biased random-key genetic algorithm for the minimization of open stacks problem
• A biased random-key genetic algorithm for single-round divisible load scheduling
• Hybridizations of GRASP with path relinking for the far from most string problem
• Combinatorial Auctions: A Survey
• Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function
• Online Set Packing
• Facet Obtaining Procedures for Set Packing Problems
• On the facial structure of set packing polyhedra
• Large Neighborhood Local Search for the Maximum Set Packing Problem
• New facets for the set packing polytope
• A set packing model for the ground holding problem in congested networks

This page was built for publication: Solving the set packing problem via a maximum weighted independent set heuristic