01924nam0 2200421 i 450 VAN0011479520240806100752.533N978-3-658-16812-420180212d2016 |0itac50 baengGERDE|||| |||||Generalized network improvement and packing problemsMichael HolzhauserWiesbadenSpringer Spektrum2016XVI, 213 p.ill.24 cmTesi di dottoratoVAN00242398Generalized network improvement and packing problems152336290-XXOperations research, mathematical programming [MSC 2020]VANC025650MF90B10Deterministic network models in operations research [MSC 2020]VANC021354MF90C60Abstract computational complexity for mathematical programming problems [MSC 2020]VANC033962MF90C90Applications of mathematical programming [MSC 2020]VANC019710MFAlgorithmic complexityKW:KApproximabilityKW:KComputational complexityKW:KFractional PackingKW:KMaximum Flow ProblemsKW:KMinimum Cost Flow ProblemsKW:KDEWiesbadenVANL000457HolzhauserMichaelVANV088814755926Springer <editore>VANV108073650ITSOL20240906RICAhttp://dx.doi.org/10.1007/978-3-658-16812-4E-book – Accesso al full-text attraverso riconoscimento IP di Ateneo, proxy e/o ShibbolethBIBLIOTECA CENTRO DI SERVIZIO SBAVAN15NVAN00114795BIBLIOTECA CENTRO DI SERVIZIO SBA15CONS SBA EBOOK 2274 15EB 2274 20180212 Generalized network improvement and packing problems1523362UNICAMPANIA