Models, algorithms and technologies for network analysis : NET 2014, Nizhny Novgorod, Russia, may 2014 / Valery A. Kalyagin, Petr A. Koldanov, Panos M. Pardalos editors |
Pubbl/distr/stampa | [Cham], : Springer, 2016 |
Descrizione fisica | XVI, 340 p. : ill. ; 24 cm |
Soggetto topico |
68Rxx - Discrete mathematics in relation to computer science [MSC 2020]
90B06 - Transportation, logistics and supply chain management [MSC 2020] 90B10 - Deterministic network models in operations research [MSC 2020] 90C10 - Integer programming [MSC 2020] 90C35 - Programming involving graphs or networks [MSC 2020] 90B80 - Discrete location and assignment [MSC 2020] 90-XX - Operations research, mathematical programming [MSC 2020] 90C31 - Sensitivity, stability, parametric optimization [MSC 2020] 90B15 - Stochastic network models in operations research [MSC 2020] 90C27 - Combinatorial optimization [MSC 2020] 90C11 - Mixed integer programming [MSC 2020] 90B18 - Communication networks in operations research [MSC 2020] 90B40 - Search theory [MSC 2020] |
Soggetto non controllato |
Coloring problem
Combinatorics Complex Networks Heuristics Maximum cliques Network analysis Steiner forest |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Titolo uniforme | |
Record Nr. | UNICAMPANIA-VAN0114996 |
[Cham], : Springer, 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Vanvitelli | ||
|
Models, algorithms and technologies for network analysis : NET 2014, Nizhny Novgorod, Russia, may 2014 / Valery A. Kalyagin, Petr A. Koldanov, Panos M. Pardalos editors |
Pubbl/distr/stampa | [Cham], : Springer, 2016 |
Descrizione fisica | XVI, 340 p. : ill. ; 24 cm |
Soggetto topico |
68Rxx - Discrete mathematics in relation to computer science [MSC 2020]
90-XX - Operations research, mathematical programming [MSC 2020] 90B06 - Transportation, logistics and supply chain management [MSC 2020] 90B10 - Deterministic network models in operations research [MSC 2020] 90B15 - Stochastic network models in operations research [MSC 2020] 90B18 - Communication networks in operations research [MSC 2020] 90B40 - Search theory [MSC 2020] 90B80 - Discrete location and assignment [MSC 2020] 90C10 - Integer programming [MSC 2020] 90C11 - Mixed integer programming [MSC 2020] 90C27 - Combinatorial optimization [MSC 2020] 90C31 - Sensitivity, stability, parametric optimization [MSC 2020] 90C35 - Programming involving graphs or networks [MSC 2020] |
Soggetto non controllato |
Coloring problem
Combinatorics Complex Networks Heuristics Maximum cliques Network analysis Steiner forest |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Titolo uniforme | |
Record Nr. | UNICAMPANIA-VAN00114996 |
[Cham], : Springer, 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Vanvitelli | ||
|
Models, algorithms and technologies for network analysis : NET 2014, Nizhny Novgorod, Russia, may 2014 / Valery A. Kalyagin, Petr A. Koldanov, Panos M. Pardalos editors |
Edizione | [[Cham] : Springer, 2016] |
Pubbl/distr/stampa | XVI, 340 p., : ill. ; 24 cm |
Descrizione fisica | Pubblicazione in formato elettronico |
Soggetto topico |
68Rxx - Discrete mathematics in relation to computer science [MSC 2020]
90B06 - Transportation, logistics and supply chain management [MSC 2020] 90B10 - Deterministic network models in operations research [MSC 2020] 90C10 - Integer programming [MSC 2020] 90C35 - Programming involving graphs or networks [MSC 2020] 90B80 - Discrete location and assignment [MSC 2020] 90-XX - Operations research, mathematical programming [MSC 2020] 90C31 - Sensitivity, stability, parametric optimization [MSC 2020] 90B15 - Stochastic network models in operations research [MSC 2020] 90C27 - Combinatorial optimization [MSC 2020] 90C11 - Mixed integer programming [MSC 2020] 90B18 - Communication networks in operations research [MSC 2020] 90B40 - Search theory [MSC 2020] |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNICAMPANIA-SUN0114996 |
XVI, 340 p., : ill. ; 24 cm | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Vanvitelli | ||
|