Large Neighborhood Local Search for the Maximum Set Packing Problem

DOI10.1007/978-3-642-39206-1_67zbMath1336.68241arXiv1302.4347OpenAlexW1923860197MaRDI QIDQ5326611

M. I. Sviridenko, Justin Ward

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.4347

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

Solving the set packing problem via a maximum weighted independent set heuristic ⋮ The limits of local search for weighted \(k\)-set packing ⋮ An evolutionary algorithm based hyper-heuristic framework for the set packing problem ⋮ The minimum feasible tileset problem ⋮ Stability and Recovery for Independence Systems ⋮ Distributed algorithms for matching in hypergraphs

This page was built for publication: Large Neighborhood Local Search for the Maximum Set Packing Problem