Search
Now showing items 1-2 of 2
A new valid inequalities for optional communication spanning tree problem
(Informs Journal on Computing, 2019)
The problem of designing a spanning tree on an underlying graph to minimize the flow costs of a given set of traffic demands is considered. Several new classes of valid inequalities are developed for the problem. Tests on ...
A cutting plane approach for the multi-machine precedence-constrained scheduling problem
(Springer, 2020)
A cutting-plane approach is developed for the problem of optimally scheduling jobs with arbitrary precedence constraints on unrelated parallel machines to minimize weighted completion time. While the single machine version ...