Download (755kB) | Preview
If a set of wastewater treatment plants is to be installed in a river basin within a given time period, an interesting optimization problem is to select the best sequence in which the plants should be built. Two sequencing problems of this kind are discussed in this paper, and branch and bound algorithms are proposed for solving them. The validity of some simplifying assumptions and the effectiveness of the methods from a computational point of view are shown by analyzing the case of the Rhine river in The Federal Republic of Germany.
|Item Type:||Monograph (IIASA Research Memorandum)|
|Research Programs:||Resources and Environment Area (REN)|
|Depositing User:||IIASA Import|
|Date Deposited:||15 Jan 2016 01:42|
|Last Modified:||27 Jul 2016 02:27|
Actions (login required)