Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Combinatorial Optimization and Applications: Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings > Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision

Combinatorial Optimization and Applications: Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings |
Springer Berlin Heidelberg
Combinatorial Optimization and Applications: Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings

Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision
Authors

ARI Id

1664728066485_2963373

Access

Not Available Free

Pages

1-13

DOI

10.1007/978-3-642-02026-1_1

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-02026-1_1

Loading...
Table of Contents of Book
Chapters/HeadingsAuthor(s)PagesInfo
Loading...
Chapters/HeadingsAuthor(s)PagesInfo
Similar Books
Loading...
Similar Chapters
Loading...
Similar Thesis
Loading...

Similar News

Loading...
Similar Articles
Loading...
Similar Article Headings
Loading...