Borrow it
 Albert D. Cohen Management Library
 Architecture/Fine Arts Library
 Archives and Special Collections
 Bibliothèque AlfredMonnin (Université de SaintBoniface)
 Bill Larson Library (Grace Hospital)
 Carolyn Sifton  Helene Fuld Library (St. Boniface General Hospital)
 Concordia Hospital Library
 Donald W. Craik Engineering Library
 E.K. Williams Law Library
 EckhardtGramatté Music Library
 Elizabeth Dafoe Library
 Fr. H. Drake Library (St. Paul's College)
 J.W. Crane Memorial Library (Deer Lodge Centre)
 Libraries Annex (not open to the public; please see web page for details)
 Neil John Maclean Health Sciences Library
 Sciences and Technology Library
 Seven Oaks General Hospital Library
 Sister St. Odilon Library (Misericordia Health Centre)
 St. John's College Library
 Victoria General Hospital Library
 William R Newman Library (Agriculture)
The Resource Integer Programming and Combinatorial Optimization : 8th International IPCO Conference, Utrecht, The Netherlands, June 1315, 2001. Proceedings, edited by Karen Aardal, Bert Gerards, (electronic resource)
Integer Programming and Combinatorial Optimization : 8th International IPCO Conference, Utrecht, The Netherlands, June 1315, 2001. Proceedings, edited by Karen Aardal, Bert Gerards, (electronic resource)
Resource Information
The item Integer Programming and Combinatorial Optimization : 8th International IPCO Conference, Utrecht, The Netherlands, June 1315, 2001. Proceedings, edited by Karen Aardal, Bert Gerards, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Manitoba Libraries.This item is available to borrow from all library branches.
Resource Information
The item Integer Programming and Combinatorial Optimization : 8th International IPCO Conference, Utrecht, The Netherlands, June 1315, 2001. Proceedings, edited by Karen Aardal, Bert Gerards, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Manitoba Libraries.
This item is available to borrow from all library branches.
 Summary
 This volume contains the papers selected for presentation at IPCO VIII, the Eighth Conference on Integer Programming and Combinatorial Optimization, Utrecht, The Netherlands, 2001. This meeting isa forum for researchers and practitioners working on various aspects of integer programming and combi torial optimization. The aim is to present recent developments in theory, com tation, and application of integer programming and combinatorial optimization. Topics include, but are not limited to: approximation algorithms, branch and bound algorithms, computational biology, computational complexity, compu tional geometry, cutting plane algorithms, diophantine equations, geometry of numbers, graph and network algorithms, integer programming, matroids and submodular functions, online algorithms, polyhedral combinatorics, scheduling theory and algorithms, and semide nit e programs. IPCO was established in 1988 when the rs t IPCO program committee was formed. The locations and years of the seven rs t IPCO conferences were: IPCO I, Waterloo (Canada) 1990, IPCO II, Pittsburgh (USA) 1992, IPCO III,  ice (Italy) 1993, IPCO IV, Copenhagen (Denmark) 1995, IPCO V, Vancouver (Canada) 1996, IPCO VI, Houston (USA) 1998, IPCO VII, Graz (Austria) 1999. IPCO is held every year in which no MPS (Mathematical Programming Society) International Symposium takes place. Since the MPS meeting is triennial, IPCO conferences are held twice in every threeyear period. Asa rule, IPCO is held somewhere in Northern America in even years, and somewhere in Europe in odd years
 Language

 eng
 eng
 Edition
 1st ed. 2001.
 Extent
 1 online resource (XII, 428 p.)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Contents

 Two O(log* k)Approximation Algorithms for the Asymmetric kCenter Problem
 Strongly Polynomial Algorithms for the Unsplittable Flow Problem
 Edge Covers of Setpairs and the Iterative Rounding Method
 The Asymptotic Performance Ratio of an OnLine Algorithm for Uniform Parallel Machine Scheduling with Release Dates
 Approximate kMSTs and kSteiner Trees via the PrimalDual Method and Lagrangean Relaxation
 On the Rank of Mixed 0,1 Polyhedra
 Fast 2Variable Integer Programming
 Approximating kSpanner Problems for k > 2
 A Matroid Generalization of the Stable Matching Polytope
 A 2Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity
 Combined Connectivity Augmentation and Orientation Problems
 An Extension of a Theorem of Henneberg and Laman
 Bisubmodular Function Minimization
 On the Integrality Gap of a Natural Formulation of the Singlesink BuyatBulk Network Design Problem
 Circuit Mengerian Directed Graphs
 Integral Polyhedra Related to Even Cycle and Even Cut Matroids
 A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems
 Synthesis of 2Commodity Flow Networks
 Bounds for Deterministic Periodic Routing sequences
 Cutting Planes for Mixed 01 Semidefinite Programs
 Independence Free Graphs and Vertex connectivity Augmentation
 The Throughput of Sequential Testing
 An Explicit Exact SDP Relaxation for Nonlinear 01 Programs
 Pruning by Isomorphism in BranchandCut
 Facets, Algorithms, and Polyhedral Characterizations for a Multiitem Production Planning Model with Setup Times
 Fences Are Futile: On Relaxations for the Linear Ordering Problem
 Generating Cuts from MultipleTerm Disjunctions
 A (2+?)Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective
 Performance Guarantees of Local Search for Multiprocessor Scheduling
 connected Joins in Graphs
 Two NPhardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines
 Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
 Isbn
 9783540455356
 Label
 Integer Programming and Combinatorial Optimization : 8th International IPCO Conference, Utrecht, The Netherlands, June 1315, 2001. Proceedings
 Title
 Integer Programming and Combinatorial Optimization
 Title remainder
 8th International IPCO Conference, Utrecht, The Netherlands, June 1315, 2001. Proceedings
 Statement of responsibility
 edited by Karen Aardal, Bert Gerards
 Language

 eng
 eng
 Summary
 This volume contains the papers selected for presentation at IPCO VIII, the Eighth Conference on Integer Programming and Combinatorial Optimization, Utrecht, The Netherlands, 2001. This meeting isa forum for researchers and practitioners working on various aspects of integer programming and combi torial optimization. The aim is to present recent developments in theory, com tation, and application of integer programming and combinatorial optimization. Topics include, but are not limited to: approximation algorithms, branch and bound algorithms, computational biology, computational complexity, compu tional geometry, cutting plane algorithms, diophantine equations, geometry of numbers, graph and network algorithms, integer programming, matroids and submodular functions, online algorithms, polyhedral combinatorics, scheduling theory and algorithms, and semide nit e programs. IPCO was established in 1988 when the rs t IPCO program committee was formed. The locations and years of the seven rs t IPCO conferences were: IPCO I, Waterloo (Canada) 1990, IPCO II, Pittsburgh (USA) 1992, IPCO III,  ice (Italy) 1993, IPCO IV, Copenhagen (Denmark) 1995, IPCO V, Vancouver (Canada) 1996, IPCO VI, Houston (USA) 1998, IPCO VII, Graz (Austria) 1999. IPCO is held every year in which no MPS (Mathematical Programming Society) International Symposium takes place. Since the MPS meeting is triennial, IPCO conferences are held twice in every threeyear period. Asa rule, IPCO is held somewhere in Northern America in even years, and somewhere in Europe in odd years
 Dewey number
 519.2
 http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt

 CgGwWjSca5w
 GpoGgUpe9IY
 Image bit depth
 0
 Language note
 English
 LC call number

 QA273.A1274.9
 QA274274.9
 Literary form
 non fiction
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorName

 Aardal, Karen.
 Gerards, Bert.
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 2081
 http://library.link/vocab/subjectName

 Distribution (Probability theory
 Computer software
 Computational complexity
 Information technology
 Combinatorics
 Probability Theory and Stochastic Processes
 Algorithm Analysis and Problem Complexity
 Discrete Mathematics in Computer Science
 IT in Business
 Combinatorics
 Label
 Integer Programming and Combinatorial Optimization : 8th International IPCO Conference, Utrecht, The Netherlands, June 1315, 2001. Proceedings, edited by Karen Aardal, Bert Gerards, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references at the end of each chapters and index
 Carrier category
 online resource
 Carrier category code

 cr
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Contents
 Two O(log* k)Approximation Algorithms for the Asymmetric kCenter Problem  Strongly Polynomial Algorithms for the Unsplittable Flow Problem  Edge Covers of Setpairs and the Iterative Rounding Method  The Asymptotic Performance Ratio of an OnLine Algorithm for Uniform Parallel Machine Scheduling with Release Dates  Approximate kMSTs and kSteiner Trees via the PrimalDual Method and Lagrangean Relaxation  On the Rank of Mixed 0,1 Polyhedra  Fast 2Variable Integer Programming  Approximating kSpanner Problems for k > 2  A Matroid Generalization of the Stable Matching Polytope  A 2Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity  Combined Connectivity Augmentation and Orientation Problems  An Extension of a Theorem of Henneberg and Laman  Bisubmodular Function Minimization  On the Integrality Gap of a Natural Formulation of the Singlesink BuyatBulk Network Design Problem  Circuit Mengerian Directed Graphs  Integral Polyhedra Related to Even Cycle and Even Cut Matroids  A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems  Synthesis of 2Commodity Flow Networks  Bounds for Deterministic Periodic Routing sequences  Cutting Planes for Mixed 01 Semidefinite Programs  Independence Free Graphs and Vertex connectivity Augmentation  The Throughput of Sequential Testing  An Explicit Exact SDP Relaxation for Nonlinear 01 Programs  Pruning by Isomorphism in BranchandCut  Facets, Algorithms, and Polyhedral Characterizations for a Multiitem Production Planning Model with Setup Times  Fences Are Futile: On Relaxations for the Linear Ordering Problem  Generating Cuts from MultipleTerm Disjunctions  A (2+?)Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective  Performance Guarantees of Local Search for Multiprocessor Scheduling  connected Joins in Graphs  Two NPhardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines  Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
 Dimensions
 unknown
 Edition
 1st ed. 2001.
 Extent
 1 online resource (XII, 428 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783540455356
 Level of compression
 uncompressed
 Media category
 computer
 Media type code

 c
 Other control number
 10.1007/3540455353
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)1000000000211491
 (SSID)ssj0000324037
 (PQKBManifestationID)11268860
 (PQKBTitleCode)TC0000324037
 (PQKBWorkID)10305013
 (PQKB)11707982
 (DEHe213)9783540455356
 (MiAaPQ)EBC3071971
 (EXLCZ)991000000000211491
 Label
 Integer Programming and Combinatorial Optimization : 8th International IPCO Conference, Utrecht, The Netherlands, June 1315, 2001. Proceedings, edited by Karen Aardal, Bert Gerards, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references at the end of each chapters and index
 Carrier category
 online resource
 Carrier category code

 cr
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Contents
 Two O(log* k)Approximation Algorithms for the Asymmetric kCenter Problem  Strongly Polynomial Algorithms for the Unsplittable Flow Problem  Edge Covers of Setpairs and the Iterative Rounding Method  The Asymptotic Performance Ratio of an OnLine Algorithm for Uniform Parallel Machine Scheduling with Release Dates  Approximate kMSTs and kSteiner Trees via the PrimalDual Method and Lagrangean Relaxation  On the Rank of Mixed 0,1 Polyhedra  Fast 2Variable Integer Programming  Approximating kSpanner Problems for k > 2  A Matroid Generalization of the Stable Matching Polytope  A 2Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity  Combined Connectivity Augmentation and Orientation Problems  An Extension of a Theorem of Henneberg and Laman  Bisubmodular Function Minimization  On the Integrality Gap of a Natural Formulation of the Singlesink BuyatBulk Network Design Problem  Circuit Mengerian Directed Graphs  Integral Polyhedra Related to Even Cycle and Even Cut Matroids  A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems  Synthesis of 2Commodity Flow Networks  Bounds for Deterministic Periodic Routing sequences  Cutting Planes for Mixed 01 Semidefinite Programs  Independence Free Graphs and Vertex connectivity Augmentation  The Throughput of Sequential Testing  An Explicit Exact SDP Relaxation for Nonlinear 01 Programs  Pruning by Isomorphism in BranchandCut  Facets, Algorithms, and Polyhedral Characterizations for a Multiitem Production Planning Model with Setup Times  Fences Are Futile: On Relaxations for the Linear Ordering Problem  Generating Cuts from MultipleTerm Disjunctions  A (2+?)Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective  Performance Guarantees of Local Search for Multiprocessor Scheduling  connected Joins in Graphs  Two NPhardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines  Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
 Dimensions
 unknown
 Edition
 1st ed. 2001.
 Extent
 1 online resource (XII, 428 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783540455356
 Level of compression
 uncompressed
 Media category
 computer
 Media type code

 c
 Other control number
 10.1007/3540455353
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)1000000000211491
 (SSID)ssj0000324037
 (PQKBManifestationID)11268860
 (PQKBTitleCode)TC0000324037
 (PQKBWorkID)10305013
 (PQKB)11707982
 (DEHe213)9783540455356
 (MiAaPQ)EBC3071971
 (EXLCZ)991000000000211491
Library Locations

Albert D. Cohen Management LibraryBorrow it181 Freedman Crescent, Winnipeg, MB, R3T 5V4, CA49.807878 97.129961


Archives and Special CollectionsBorrow it25 Chancellors Circle (Elizabeth Dafoe Library), Room 330, Winnipeg, MB, R3T 2N2, CA49.809961 97.131878

Bibliothèque AlfredMonnin (Université de SaintBoniface)Borrow it200, avenue de la Cathédrale, Local 2110, Winnipeg, MB, R2H 0H7, CA49.888861 97.119735

Bill Larson Library (Grace Hospital)Borrow it300 Booth Drive, G227, Winnipeg, MB, R3J 3M7, CA49.882400 97.276436

Carolyn Sifton  Helene Fuld Library (St. Boniface General Hospital)Borrow it409 Tache Avenue, Winnipeg, MB, R2H 2A6, CA49.883388 97.126050

Concordia Hospital LibraryBorrow it1095 Concordia Avenue, Winnipeg, MB, R2K 3S8, CA49.913252 97.064683

Donald W. Craik Engineering LibraryBorrow it75B Chancellors Circle (Engineering Building E3), Room 361, Winnipeg, MB, R3T 2N2, CA49.809053 97.133292


EckhardtGramatté Music LibraryBorrow it136 Dafoe Road (Taché Arts Complex), Room 257, Winnipeg, MB, R3T 2N2, CA49.807964 97.132222

Elizabeth Dafoe LibraryBorrow it25 Chancellors Circle, Winnipeg, MB, R3T 2N2, CA49.809961 97.131878

Fr. H. Drake Library (St. Paul's College)Borrow it70 Dysart Road, Winnipeg, MB, R3T 2M6, CA49.810605 97.138184

J.W. Crane Memorial Library (Deer Lodge Centre)Borrow it2109 Portage Avenue, Winnipeg, MB, R3J 0L3, CA49.878000 97.235520

Libraries Annex (not open to the public; please see web page for details)Borrow it25 Chancellors Circle (in the Elizabeth Dafoe Library), Winnipeg, MB, R3T 2N2, CA49.809961 97.131878

Neil John Maclean Health Sciences LibraryBorrow it727 McDermot Avenue (Brodie Centre), 200 Level, Winnipeg, MB, R3E 3P5, CA49.903563 97.160554

Sciences and Technology LibraryBorrow it186 Dysart Road, Winnipeg, MB, R3T 2M8, CA49.811526 97.133257

Seven Oaks General Hospital LibraryBorrow it2300 McPhillips Street, Winnipeg, MB, R2V 3M3, CA49.955177 97.148865

Sister St. Odilon Library (Misericordia Health Centre)Borrow it99 Cornish Avenue, Winnipeg, MB, R3C 1A2, CA49.879592 97.160425


Victoria General Hospital LibraryBorrow it2340 Pembina Highway, Winnipeg, MB, R3T 2E8, CA49.806755 97.152739

William R Newman Library (Agriculture)Borrow it66 Dafoe Road, Winnipeg, MB, R3T 2R3, CA49.806936 97.135525
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.lib.umanitoba.ca/portal/IntegerProgrammingandCombinatorial/Nt3n2AooiUk/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.lib.umanitoba.ca/portal/IntegerProgrammingandCombinatorial/Nt3n2AooiUk/">Integer Programming and Combinatorial Optimization : 8th International IPCO Conference, Utrecht, The Netherlands, June 1315, 2001. Proceedings, edited by Karen Aardal, Bert Gerards, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.lib.umanitoba.ca/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.lib.umanitoba.ca/">University of Manitoba Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Integer Programming and Combinatorial Optimization : 8th International IPCO Conference, Utrecht, The Netherlands, June 1315, 2001. Proceedings, edited by Karen Aardal, Bert Gerards, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.lib.umanitoba.ca/portal/IntegerProgrammingandCombinatorial/Nt3n2AooiUk/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.lib.umanitoba.ca/portal/IntegerProgrammingandCombinatorial/Nt3n2AooiUk/">Integer Programming and Combinatorial Optimization : 8th International IPCO Conference, Utrecht, The Netherlands, June 1315, 2001. Proceedings, edited by Karen Aardal, Bert Gerards, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.lib.umanitoba.ca/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.lib.umanitoba.ca/">University of Manitoba Libraries</a></span></span></span></span></div>