31 citations · 97 across the 10 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013★ 10 cited
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period
Natashia Boland, Thomas Kalinowski, Simranjit Kaur
We study the problem of scheduling maintenance on arcs of a capacitated network so as to maximize the total flow from a source node to a sink node over a set of time periods. Maint…
cs.DM2013★ 4 cited
Scheduling unit processing time arc shutdown jobs to maximize network flow over time: complexity results
Natashia Boland, Thomas Kalinowski, Reena Kapoor +1
We study the problem of scheduling maintenance on arcs of a capacitated network so as to maximize the total flow from a source node to a sink node over a set of time periods. Maint…