A greedy heuristic for 3-partitioning with similar elements

DOI10.1007/BF02243817MaRDI QIDQ685863zbMATH OpenFDO

Authors Hans Kellerer, Gerhard J. Woeginger

Publication date 18 October 1993

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02243817

zbMATH Keywords

bin packinggreedy-type algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• A performance guarantee for the greedy set-partitioning algorithm
• A tight bound for 3-partitioning
• Worst-case analysis of the subset sum algorithm for bin packing.
• Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
• Algorithms for the variable sized bin packing problem

Cites work

• A performance guarantee for the greedy set-partitioning algorithm
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

Cited in

(5)

• Minmax combinatorial optimization
• A tight upper bound for the \(k\)-partition problem on ideal sets
• A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines
• Three Partition Refinement Algorithms
• 3-partitioning problems for maximizing the minimum load

This page was built for publication: A greedy heuristic for 3-partitioning with similar elements

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