scientific article; zbMATH DE number 3943557

zbMATH Open0587.90071MaRDI QIDQ3714899FDOQ3714899

Authors: C. Vercellis 

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

• Average case analysis of the set packing problem
• scientific article; zbMATH DE number 4099049
• Stochastic set packing problem
• Probabilistic Analysis of the Multidimensional Knapsack Problem
• Application of implicit enumeration to solve the packing problem

zbMATH Keywords

duality gapthreshold functionprobabilistic analysisblind sequential algorithmmaximum cardinality set packing problemNP- hard integer programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Integer programming (90C10) Algorithms in computer science (68W99)

Cited In (9)

• Solving the set packing problem via a maximum weighted independent set heuristic
• Dynamic node packing
• Title not available (Why is that?)
• Randomized algorithms in combinatorial optimization: A survey
• Stochastic set packing problem
• Average case analysis of the set packing problem
• The intersection graph of random sets
• Application of implicit enumeration to solve the packing problem
• Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics

This page was built for publication:

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