The modified differencing method for the set partitioning problem with cardinality constraints

DOI10.1016/0166-218X(94)00032-9zbMath0837.90105MaRDI QIDQ1902901

Li-Hui Tasi

Publication date: 13 May 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

set partitioningdifferencing methodMakespan schedulingasymptotic algorithm analysis

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (5)

Performance ratios of the Karmarkar-Karp differencing method ⋮ Computer-assisted proof of performance ratios for the differencing method ⋮ Pattern minimisation in cutting stock problems ⋮ Unnamed Item ⋮ An analysis of the LPT algorithm for the max-min and the min-ratio partition problems

Cites Work

• Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics
• Unnamed Item

This page was built for publication: The modified differencing method for the set partitioning problem with cardinality constraints