Approximating unrelated machine weighted completion time using iterative rounding and computer assisted proofs

DOI10.1137/1.9781611978322.17MaRDI QIDQ7289575zbMATH OpenFDO

Authors Shi Li

Publication date 3 July 2026

Full work available at URL https://doi.org/10.1137/1.9781611978322.17

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Mathematical programming approaches for social welfare maximization

This page was built for publication: Approximating unrelated machine weighted completion time using iterative rounding and computer assisted proofs

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