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

DOI10.1016/0166-218X(94)00032-9MaRDI QIDQ1902901zbMATH OpenFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1962846
• Computer-assisted proof of performance ratios for the differencing method
• A note on the average-case behavior of a simple differencing method for partitioning
• The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and Karp
• scientific article; zbMATH DE number 1112368

Cites work

• scientific article; zbMATH DE number 52589 (Why is no real title available?)
• Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics

Cited in

(6)

• scientific article; zbMATH DE number 2230249 (Why is no real title available?)
• scientific article; zbMATH DE number 1962846 (Why is no real title available?)
• Computer-assisted proof of performance ratios for the differencing method
• Performance ratios of the Karmarkar-Karp differencing method
• Pattern minimisation in cutting stock problems
• An analysis of the LPT algorithm for the max-min and the min-ratio partition problems

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

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