A greedy heuristic for 3-partitioning with similar elements
From MaRDI portal
Publication:685863
DOI10.1007/BF02243817zbMath0789.90061MaRDI QIDQ685863
Hans Kellerer, Gerhard J. Woeginger
Publication date: 18 October 1993
Published in: Computing (Search for Journal in Brave)
Related Items
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
Cites Work
This page was built for publication: A greedy heuristic for 3-partitioning with similar elements
