On local search for weighted k-set packing

DOI10.1007/3-540-63397-9_2MaRDI QIDQ826067zbMATH OpenOpenAlexFDO

Authors Esther M. Arkin, Refael Hassin

Publication date 20 December 2021

Full work available at URL https://doi.org/10.1007/3-540-63397-9_2

zbMATH Keywords

local searchpacking problemmaximum total weightsmall cycle

Mathematics Subject Classification ID

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

Recommendations

• On local search for weighted \(k\)-set packing
• The limits of local search for weighted \(k\)-set packing
• Greedy local improvement and weighted set packing approximation
• scientific article; zbMATH DE number 1305405
• Approximating the \(k\)-set packing problem by local improvements
• On the complexity of approximating \(k\)-set packing
• Large neighborhood local search for the maximum set packing problem
• Local search of orthogonal packings using the lower bounds
• On the complexity of local search for weighted standard set problems
• Solving the set packing problem via a maximum weighted independent set heuristic

Cited in

(7)

• Large neighborhood local search for the maximum set packing problem
• The limits of local search for weighted \(k\)-set packing
• Data dependent worst case bounds for weighted set packing
• Greedy local improvement and weighted set packing approximation
• The limits of local search for weighted \(k\)-set packing
• Local search strikes again: PTAS for variants of geometric covering and packing
• On local search for weighted \(k\)-set packing

This page was built for publication: On local search for weighted \(k\)-set packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q826067)