A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Network Flow Optimization with Minimum Quantities
[chapter]
2011
Operations Research Proceedings
Economies of scale often appear as decreasing marginal costs, but may also occur as a constraint that at least a minimum quantity should be produced or nothing at all. Taking the latter into account can support decisions about keeping a production site, setting up a new one, establishing new routes in logistics network, and many more. In our work, we define the corresponding problem Minimum Cost Network Flow with Minimum Quantities and prove its computational hardness. Following that, we devise
doi:10.1007/978-3-642-20009-0_47
dblp:conf/or/Seedig10
fatcat:vp3mdsd4nvgfbejgikmfpt2zie