Seller
Your price
£43.68
RRP: £54.99
Save £11.31 (21%)
Printed on Demand
Dispatched within 14-21 working days.
Trade or Institutional customer? Contact us about large order quotes.
Synopsis
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. New & Used
| Seller | Information | Condition | Price | |
|---|---|---|---|---|
 | - | New | £43.68 + FREE UK P & P |
What Reviewers Are Saying
Be the first to review this item.
Submit your review now