Pages that link to "Item:Q1178234"
From MaRDI portal
The following pages link to On minimizing the sum of \(k\) tardinesses (Q1178234):
Displaying 7 items.
- Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization (Q256707) (← links)
- Minimizing the number of tardy jobs in single machine sequencing (Q686166) (← links)
- A polynomial algorithm for an integer quadratic non-separable transportation problem (Q1198737) (← links)
- A note on the equivalence of two heuristics to minimize total tardiness (Q1278526) (← links)
- The partial sum criterion for Steiner trees in graphs and shortest paths (Q1278596) (← links)
- Bridging \(k\)-sum and CVaR optimization in MILP (Q1722975) (← links)
- On \(k\)-sum optimization (Q1919195) (← links)