skip to content
Integer Programming and Combinatorial Optimization : 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings Preview this item
ClosePreview this item
Checking...

Integer Programming and Combinatorial Optimization : 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings

Author: Michael Jünger; Volker Kaibel
Publisher: Berlin Heidelberg : Springer-Verlag., 2005.
Series: Lecture notes in computer science, 3509.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Publication:Springer e-books
Summary:
This book constitutes the refereed proceedings of the 11th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2005, held in Berlin, Germany in June 2005. The 34 revised full papers presented were carefully reviewed and selected from 119 submissions. Among the topics addressed are mixed-integer programming, graph theory, graph algorithms, approximation, linear programming,  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: Printed edition:
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Michael Jünger; Volker Kaibel
ISBN: 3540321020 9783540321026
OCLC Number: 228158415
Description: 1 online resource (: v.: digital.
Contents: Mixed-Integer Cuts from Cyclic Groups --
Optimizing over the First Chvàtal Closure --
Sequential Pairing of Mixed Integer Inequalities --
Approximate Min-max Relations for Odd Cycles in Planar Graphs --
Disjoint Cycles: Integrality Gap, Hardness, and Approximation --
A Combinatorial Algorithm to Find a Maximum Even Factor --
Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems --
On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem --
Inventory and Facility Location Models with Market Selection --
On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations --
Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials --
Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring --
On the Inefficiency of Equilibria in Congestion Games --
Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times --
LP-Based Online Scheduling: From Single to Parallel Machines --
Unique Sink Orientations of Grids --
Jumping Doesn't Help in Abstract Cubes --
Computing the Inertia from Sign Patterns --
Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem --
On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem --
Smoothed Analysis of Integer Programming --
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs --
Approximation Algorithms for Stochastic Inventory Control Models --
On Two-Stage Stochastic Minimum Spanning Trees --
Combinatorial Analysis of Generic Matrix Pencils --
Power Optimization for Connectivity Problems --
Packing Steiner Forests --
Bidimensional Packing by Bilinear Programming --
On the L???-Norm of Extreme Points for Crossing Supermodular Directed Network LPs --
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks --
Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem --
Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems --
A Study of Domino-Parity and k-Parity Constraints for the TSP --
Not Every GTSP Facet Induces an STSP Facet.
Series Title: Lecture notes in computer science, 3509.
Responsibility: edited by Michael Jünger, Volker Kaibel.

Abstract:

This book constitutes the refereed proceedings of the 11th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2005, held in Berlin, Germany in June 2005. The 34 revised full papers presented were carefully reviewed and selected from 119 submissions. Among the topics addressed are mixed-integer programming, graph theory, graph algorithms, approximation, linear programming, approximability, packing, scheduling, computational geometry, randomization, network algorithms, sequencing, TSP, and travelling salesman problem.

Reviews

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

Tags

Be the first.
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/228158415> # Integer Programming and Combinatorial Optimization : 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings
    a schema:CreativeWork, schema:MediaObject, schema:Book ;
    library:oclcnum "228158415" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/891627789#Place/berlin_heidelberg> ; # Berlin Heidelberg
    schema:about <http://experiment.worldcat.org/entity/work/data/891627789#Topic/numeric_computing> ; # Numeric Computing
    schema:about <http://experiment.worldcat.org/entity/work/data/891627789#Topic/computer_science> ; # Computer Science
    schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
    schema:about <http://experiment.worldcat.org/entity/work/data/891627789#Topic/algorithm_analysis_and_problem_complexity> ; # Algorithm Analysis and Problem Complexity
    schema:about <http://experiment.worldcat.org/entity/work/data/891627789#Topic/discrete_mathematics_in_computer_science> ; # Discrete Mathematics in Computer Science
    schema:about <http://id.worldcat.org/fast/906956> ; # Electronic data processing
    schema:about <http://id.worldcat.org/fast/872527> ; # Computer software
    schema:about <http://dewey.info/class/519.77/e22/> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/891627789#Topic/computer_graphics> ; # Computer Graphics
    schema:about <http://id.worldcat.org/fast/872119> ; # Computer graphics
    schema:bookFormat schema:EBook ;
    schema:contributor <http://viaf.org/viaf/12611405> ; # Volker Kaibel
    schema:creator <http://viaf.org/viaf/37160246> ; # Michael Jünger
    schema:datePublished "2005" ;
    schema:description "Mixed-Integer Cuts from Cyclic Groups -- Optimizing over the First Chvàtal Closure -- Sequential Pairing of Mixed Integer Inequalities -- Approximate Min-max Relations for Odd Cycles in Planar Graphs -- Disjoint Cycles: Integrality Gap, Hardness, and Approximation -- A Combinatorial Algorithm to Find a Maximum Even Factor -- Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems -- On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem -- Inventory and Facility Location Models with Market Selection -- On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations -- Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials -- Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring -- On the Inefficiency of Equilibria in Congestion Games -- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times -- LP-Based Online Scheduling: From Single to Parallel Machines -- Unique Sink Orientations of Grids -- Jumping Doesn't Help in Abstract Cubes -- Computing the Inertia from Sign Patterns -- Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem -- On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem -- Smoothed Analysis of Integer Programming -- Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs -- Approximation Algorithms for Stochastic Inventory Control Models -- On Two-Stage Stochastic Minimum Spanning Trees -- Combinatorial Analysis of Generic Matrix Pencils -- Power Optimization for Connectivity Problems -- Packing Steiner Forests -- Bidimensional Packing by Bilinear Programming -- On the L???-Norm of Extreme Points for Crossing Supermodular Directed Network LPs -- Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks -- Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem -- Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems -- A Study of Domino-Parity and k-Parity Constraints for the TSP -- Not Every GTSP Facet Induces an STSP Facet."@en ;
    schema:description "This book constitutes the refereed proceedings of the 11th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2005, held in Berlin, Germany in June 2005. The 34 revised full papers presented were carefully reviewed and selected from 119 submissions. Among the topics addressed are mixed-integer programming, graph theory, graph algorithms, approximation, linear programming, approximability, packing, scheduling, computational geometry, randomization, network algorithms, sequencing, TSP, and travelling salesman problem."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/891627789> ;
    schema:genre "Electronic books"@en ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://worldcat.org/issn/0302-9743> ; # Lecture notes in computer science ;
    schema:isSimilarTo <http://worldcat.org/entity/work/data/891627789#CreativeWork/> ;
    schema:name "Integer Programming and Combinatorial Optimization : 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings"@en ;
    schema:productID "228158415" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/228158415#PublicationEvent/berlin_heidelberg_springer_verlag_2005> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/891627789#Agent/springer_verlag> ; # Springer-Verlag.
    schema:url <http://dx.doi.org/10.1007/b137143> ;
    schema:url <http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0302-9743&volume=3509> ;
    schema:workExample <http://worldcat.org/isbn/9783540321026> ;
    schema:workExample <http://dx.doi.org/10.1007/b137143> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/228158415> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/891627789#Agent/springer_verlag> # Springer-Verlag.
    a bgn:Agent ;
    schema:name "Springer-Verlag." ;
    .

<http://experiment.worldcat.org/entity/work/data/891627789#Place/berlin_heidelberg> # Berlin Heidelberg
    a schema:Place ;
    schema:name "Berlin Heidelberg" ;
    .

<http://experiment.worldcat.org/entity/work/data/891627789#Topic/algorithm_analysis_and_problem_complexity> # Algorithm Analysis and Problem Complexity
    a schema:Intangible ;
    schema:name "Algorithm Analysis and Problem Complexity"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/891627789#Topic/computer_graphics> # Computer Graphics
    a schema:Intangible ;
    schema:name "Computer Graphics"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/891627789#Topic/discrete_mathematics_in_computer_science> # Discrete Mathematics in Computer Science
    a schema:Intangible ;
    schema:name "Discrete Mathematics in Computer Science"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/891627789#Topic/numeric_computing> # Numeric Computing
    a schema:Intangible ;
    schema:name "Numeric Computing"@en ;
    .

<http://id.worldcat.org/fast/871991> # Computational complexity
    a schema:Intangible ;
    schema:name "Computational complexity"@en ;
    .

<http://id.worldcat.org/fast/872119> # Computer graphics
    a schema:Intangible ;
    schema:name "Computer graphics"@en ;
    .

<http://id.worldcat.org/fast/872527> # Computer software
    a schema:Intangible ;
    schema:name "Computer software"@en ;
    .

<http://id.worldcat.org/fast/906956> # Electronic data processing
    a schema:Intangible ;
    schema:name "Electronic data processing"@en ;
    .

<http://viaf.org/viaf/12611405> # Volker Kaibel
    a schema:Person ;
    schema:familyName "Kaibel" ;
    schema:givenName "Volker" ;
    schema:name "Volker Kaibel" ;
    .

<http://viaf.org/viaf/37160246> # Michael Jünger
    a schema:Person ;
    schema:familyName "Jünger" ;
    schema:givenName "Michael" ;
    schema:name "Michael Jünger" ;
    .

<http://worldcat.org/entity/work/data/891627789#CreativeWork/>
    a schema:CreativeWork ;
    schema:description "Printed edition:" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/228158415> ; # Integer Programming and Combinatorial Optimization : 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings
    .

<http://worldcat.org/isbn/9783540321026>
    a schema:ProductModel ;
    schema:isbn "3540321020" ;
    schema:isbn "9783540321026" ;
    .

<http://worldcat.org/issn/0302-9743> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/228158415> ; # Integer Programming and Combinatorial Optimization : 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings
    schema:issn "0302-9743" ;
    schema:name "Lecture notes in computer science ;" ;
    schema:name "Lecture Notes in Computer Science," ;
    .

<http://www.worldcat.org/title/-/oclc/228158415>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
    schema:about <http://www.worldcat.org/oclc/228158415> ; # Integer Programming and Combinatorial Optimization : 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings
    schema:dateModified "2018-06-13" ;
    void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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