A greedy heuristic for 3-partitioning with similar elements

DOI10.1007/BF02243817zbMATH Open0789.90061MaRDI QIDQ685863FDOQ685863

Authors: Hans Kellerer, Gerhard J. Woeginger 

Publication date: 18 October 1993

Published in: Computing (Search for Journal in Brave)

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

zbMATH Keywords

bin packinggreedy-type algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• A performance guarantee for the greedy set-partitioning algorithm

Cited In (5)

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

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)