01950nam0 2200397 i 450 VAN011535120220316110651.888N978-3-658-13913-120180305d2016 |0itac50 baengDE|||| |||||Solving network design problems via decomposition, aggregation and approximationwith an application to the optimal expansion of railway infrastructureAndreas BärmannWiesbadenSpringer Spektrum2016XV, 203 p.ill.24 cmVAN0243153Solving network design problems via decomposition, aggregation and approximation152362990C90Applications of mathematical programming [MSC 2020]VANC019710MF90B06Transportation, logistics and supply chain management [MSC 2020]VANC021353MF90B50Management decision making, including multiple objectives [MSC 2020]VANC025286MF90-XXOperations research, mathematical programming [MSC 2020]VANC025650MFAggregationKW:KDecompositionKW:KDiscrete OptimizationKW:KNetwork designKW:KRobust OptimizationKW:KDEWiesbadenVANL000457BärmannAndreasVANV089266756079Springer <editore>VANV108073650ITSOL20240614RICAhttp://dx.doi.org/10.1007/978-3-658-13913-1E-book – Accesso al full-text attraverso riconoscimento IP di Ateneo, proxy e/o ShibbolethBIBLIOTECA CENTRO DI SERVIZIO SBAVAN15NVAN0115351BIBLIOTECA CENTRO DI SERVIZIO SBA15CONS SBA EBOOK 2503 15EB 2503 20180305 Solving network design problems via decomposition, aggregation and approximation1523629UNICAMPANIA