skip to content
Generalized Network Improvement and Packing Problems. Preview this item
ClosePreview this item
Checking...

Generalized Network Improvement and Packing Problems.

Author: Michael Holzhauser
Publisher: Wiesbaden : Springer Fachmedien Wiesbaden, 2017.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Summary:
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. Contents Fractional Packing and  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Additional Physical Format: Print version:
Holzhauser, Michael.
Generalized Network Improvement and Packing Problems.
Wiesbaden : Springer Fachmedien Wiesbaden, ©2017
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Michael Holzhauser
ISBN: 9783658168124 3658168129
OCLC Number: 968727074
Description: 1 online resource (220 pages)
Contents: Acknowledgments; Abstract; Zusammenfassung; Contents; List of Figures; List of Tables; 1 Introduction; 2 Preliminaries; 2.1 Basic Notation; 2.2 Theory of Computation; 2.3 Graph Theory; 2.4 Network Flow Problems; 2.5 Approximation Algorithms; 3 Fractional Packing and Parametric Search Frameworks; 3.1 Parametric Search; 3.2 Fractional Packing Framework; 3.3 A Generalized Framework; 3.3.1 Minimizing Oracles; 3.3.2 Sign Oracles; 3.3.3 Separation Oracles; 3.4 Conclusion; 4 Budget-Constrained Minimum Cost Flows: The Continuous Case; 4.1 Introduction; 4.1.1 Previous Work; 4.1.2 Chapter Outline. 4.2 Preliminaries4.3 Network Simplex Algorithm; 4.3.1 Notation and Definitions; 4.3.2 Network Simplex Pivots; 4.3.3 Optimality Conditions; 4.3.4 Termination and Running Time; 4.4 Bicriteria Interpretation; 4.4.1 A Weakly Polynomial-Time Algorithm; 4.4.2 A Strongly Polynomial-Time Algorithm; 4.5 Approximability; 4.5.1 General Graphs; 4.5.2 Acyclic Graphs; 4.6 Conclusion; 5 Budget-Constrained Minimum Cost Flows: The Discrete Case; 5.1 Introduction; 5.1.1 Previous Work; 5.1.2 Chapter Outline; 5.2 Preliminaries; 5.3 Integral Case; 5.3.1 Complexity; 5.3.2 Approximability; 5.3.3 Exact Algorithm. 5.4 The Bounded Knapsack Problem with Laminar Cardinality Constraints5.4.1 A Polynomial-Time Approximation Scheme; 5.4.2 Fully Polynomial-Time Approximation Schemes; 5.4.3 A Polynomial-Time Solvable Special Case; 5.5 Binary Case; 5.6 Conclusion; 6 Generalized Processing Networks; 6.1 Introduction; 6.1.1 Previous Work; 6.1.2 Chapter Outline; 6.2 Preliminaries; 6.3 Structural Results; 6.4 Complexity and Approximability; 6.4.1 Complexity; 6.4.2 Approximability; 6.5 Series-Parallel Graphs; 6.5.1 Augmenting on Flow Distribution Schemes; 6.5.2 A Faster Approach; 6.6 Integral Flows; 6.7 Conclusion. 7 Convex Generalized Flows7.1 Introduction; 7.1.1 Previous Work; 7.1.2 Chapter Outline; 7.2 Preliminaries; 7.3 Structural Results; 7.4 Complexity and Approximability; 7.4.1 Complexity; 7.4.2 Approximability; 7.5 Exact Algorithms; 7.5.1 General Graphs; 7.5.2 Acyclic Graphs; 7.5.3 Series-Parallel Graphs; 7.5.4 Extension-Parallel Graphs; 7.5.5 Restricted Extension-Parallel Graphs; 7.6 Integral Flows; 7.7 Conclusion; 8 Conclusion; Bibliography; Glossary; Index.

Abstract:

Michael Holzhauser discusses generalizations of well-known network flow and packing problems by additional or modified side constraints.  Read more...

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/968727074> # Generalized Network Improvement and Packing Problems.
    a schema:MediaObject, schema:Book, schema:CreativeWork ;
    library:oclcnum "968727074" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/3975974070#Place/wiesbaden> ; # Wiesbaden
    schema:about <http://dewey.info/class/510/> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/3975974070#Topic/computational_complexity> ; # Computational complexity
    schema:bookFormat schema:EBook ;
    schema:creator <http://experiment.worldcat.org/entity/work/data/3975974070#Person/holzhauser_michael> ; # Michael Holzhauser
    schema:datePublished "2017" ;
    schema:description "Acknowledgments; Abstract; Zusammenfassung; Contents; List of Figures; List of Tables; 1 Introduction; 2 Preliminaries; 2.1 Basic Notation; 2.2 Theory of Computation; 2.3 Graph Theory; 2.4 Network Flow Problems; 2.5 Approximation Algorithms; 3 Fractional Packing and Parametric Search Frameworks; 3.1 Parametric Search; 3.2 Fractional Packing Framework; 3.3 A Generalized Framework; 3.3.1 Minimizing Oracles; 3.3.2 Sign Oracles; 3.3.3 Separation Oracles; 3.4 Conclusion; 4 Budget-Constrained Minimum Cost Flows: The Continuous Case; 4.1 Introduction; 4.1.1 Previous Work; 4.1.2 Chapter Outline."@en ;
    schema:description "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. Contents Fractional Packing and Parametric Search Frameworks Budget-Constrained Minimum Cost Flows: The Continuous Case Budget-Constrained Minimum Cost Flows: The Discrete Case Generalized Processing Networks Convex Generalized Flows Target Groups Researchers and students in the fields of mathematics, computer science, and economics Practitioners in operations research and logistics The Author Dr. Michael Holzhauser studied computer science at the University of Kaiserslautern and is now a research fellow in the Optimization Research Group at the Department of Mathematics of the University of Kaiserslautern."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/3975974070> ;
    schema:genre "Electronic books"@en ;
    schema:inLanguage "en" ;
    schema:isSimilarTo <http://worldcat.org/entity/work/data/3975974070#CreativeWork/generalized_network_improvement_and_packing_problems> ;
    schema:name "Generalized Network Improvement and Packing Problems."@en ;
    schema:productID "968727074" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/968727074#PublicationEvent/wiesbaden_springer_fachmedien_wiesbaden_2017> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/3975974070#Agent/springer_fachmedien_wiesbaden> ; # Springer Fachmedien Wiesbaden
    schema:url <http://rave.ohiolink.edu/ebooks/ebc/9783658168124> ;
    schema:url <http://proxy.ohiolink.edu:9099/login?url=http://link.springer.com/10.1007/978-3-658-16812-4> ;
    schema:url <https://login.libproxy.noctrl.edu/login?url=http://link.springer.com/10.1007/978-3-658-16812-4> ;
    schema:url <https://login.proxy.lib.strath.ac.uk/login?url=http://link.springer.com/10.1007/978-3-658-16812-4> ;
    schema:url <https://login.proxy.bib.uottawa.ca/login?url=http://link.springer.com/10.1007/978-3-658-16812-4> ;
    schema:url <https://0-link-springer-com.pugwash.lib.warwick.ac.uk/book/10.1007/978-3-658-16812-4> ;
    schema:url <http://libproxy.uwinnipeg.ca/login?url=http://link.springer.com/10.1007/978-3-658-16812-4> ;
    schema:url <http://public.eblib.com/choice/publicfullrecord.aspx?p=4776566> ;
    schema:url <http://link.springer.com/10.1007/978-3-658-16812-4> ;
    schema:url <https://grinnell.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-658-16812-4> ;
    schema:url <http://ebookcentral.proquest.com/lib/ucm/detail.action?docID=4776566> ;
    schema:url <http://library.icc.edu/login?url=http://ebookcentral.proquest.com/lib/illcencol-ebooks/detail.action?docID=4776566> ;
    schema:url <http://sfx.carli.illinois.edu/sfxwhe/sfx_local?genre=book&sid=Voyager:WHE&sfx.ignore_date_threshold=1&svc.fulltext=yes&rft.isbn=978-3-658-16812-4> ;
    schema:workExample <http://worldcat.org/isbn/9783658168124> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/968727074> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/3975974070#Agent/springer_fachmedien_wiesbaden> # Springer Fachmedien Wiesbaden
    a bgn:Agent ;
    schema:name "Springer Fachmedien Wiesbaden" ;
    .

<http://experiment.worldcat.org/entity/work/data/3975974070#Person/holzhauser_michael> # Michael Holzhauser
    a schema:Person ;
    schema:familyName "Holzhauser" ;
    schema:givenName "Michael" ;
    schema:name "Michael Holzhauser" ;
    .

<http://experiment.worldcat.org/entity/work/data/3975974070#Topic/computational_complexity> # Computational complexity
    a schema:Intangible ;
    schema:name "Computational complexity"@en ;
    .

<http://rave.ohiolink.edu/ebooks/ebc/9783658168124>
    rdfs:comment "Connect to resource" ;
    .

<http://worldcat.org/entity/work/data/3975974070#CreativeWork/generalized_network_improvement_and_packing_problems>
    a schema:CreativeWork ;
    rdfs:label "Generalized Network Improvement and Packing Problems." ;
    schema:description "Print version:" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/968727074> ; # Generalized Network Improvement and Packing Problems.
    .

<http://worldcat.org/isbn/9783658168124>
    a schema:ProductModel ;
    schema:isbn "3658168129" ;
    schema:isbn "9783658168124" ;
    .

<https://login.proxy.bib.uottawa.ca/login?url=http://link.springer.com/10.1007/978-3-658-16812-4>
    rdfs:comment "SpringerLink (Restricted to University of Ottawa)" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.