Reduction criteria, upper bounds, and a dynamic programming based heuristic for the max–min $$k_i$$ k i -partitioning problem
Crossref DOI link: https://doi.org/10.1007/s10732-017-9362-9
Published Online: 2017-12-08
Published Print: 2018-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Lawrinenko, Alexander
Schwerdfeger, Stefan
Walter, Rico
License valid from 2017-12-08