0
Your cart
![]() |
![]() |
Your cart is empty |
||
Showing 1 - 2 of 2 matches in All Departments
Michael Holzhauser discusses generalizations of well-known network flow and packing problems by additional or modified side constraints. By exploiting the inherent connection between the two problem classes, the author investigates the complexity and approximability of several novel network flow and packing problems and presents combinatorial solution and approximation algorithms.
|
![]() ![]() You may like...
Jurassic Park Trilogy Collection
Sam Neill, Laura Dern, …
Blu-ray disc
![]() R311 Discovery Miles 3 110
|