The Resource Integer Programming and Combinatorial Optimization : 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 2628, 2017, Proceedings, edited by Friedrich Eisenbrand, Jochen Koenemann, (electronic book)
Integer Programming and Combinatorial Optimization : 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 2628, 2017, Proceedings, edited by Friedrich Eisenbrand, Jochen Koenemann, (electronic book)
Resource Information
The item Integer Programming and Combinatorial Optimization : 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 2628, 2017, Proceedings, edited by Friedrich Eisenbrand, Jochen Koenemann, (electronic book) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Liverpool.This item is available to borrow from 1 library branch.
Resource Information
The item Integer Programming and Combinatorial Optimization : 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 2628, 2017, Proceedings, edited by Friedrich Eisenbrand, Jochen Koenemann, (electronic book) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Liverpool.
This item is available to borrow from 1 library branch.
 Summary
 This book constitutes the refereed proceedings of the 19th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2017, held in Waterloo, IN, Canada, in June 2017. The 36 full papers presented were carefully reviewed and selected from 125 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems
 Language
 eng
 Extent
 1 online resource (XI, 456 p. 34 illus.)
 Contents

 The Twopoint Fano and Ideal Binary Clutters
 On Scheduling Coflows
 Integrality Gaps of Integer Knapsack Problems
 An Improved Integrality Gap for the CalinescuKarloffRabani Relaxation for Multiway Cut
 Approximation of Corner Polyhedra with Families of Intersection Cuts
 The Structure of the Infinite Models in Integer Programming
 Mixedinteger Linear Representability, Disjunctions, and Variable Elimination
 Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time
 Cutting Planes from Wide Split Disjunctions
 The Salesman's Improved Tours for Fundamental Classes
 The Heterogeneous Capacitated kCenter Problem
 Local Guarantees in Graph Cuts and Clustering
 Verifying Integer Programming Results
 Long term Behavior of Dynamic Equilibria in uid Queuing Networks
 A 4/5
 Approximation Algorithm for the Maximum Traveling Salesman Problem
 Minimizing Multimodular Functions and Allocating Capacity in Bikesharing Systems
 Compact, ProvablyGood LPs for Orienteering and RegretBounded Vehicle Routing
 Discrete Newton's Algorithm for Parametric Submodular Function Minimization
 Stochastic Online Scheduling on Unrelated Machines
 Online Matroid Intersection: Beating Half for Random Arrival
 Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector
 An Improved Deterministic Rescaling for Linear Programming Algorithms
 MinMax Theorems for Packing and Covering Odd (u; v)trails
 Breaking 1
 1/e Barrier for Nonpreemptive Throughput Maximization
 A QuasiPolynomial Approximation for the Restricted Assignment Problem
 Adaptive Submodular Ranking
 On the Notions of Facets, Weak Facets, and Extreme Functions of the GomoryJohnson Infinite Group Problem
 Minimum Birkhoffvon Neumann Decomposition
 Maximum Matching in the Online BatchArrival Model
 Budget Feasible Mechanisms on Matroids
 Deterministic Discrepancy Minimization Via the Multiplicative Weight Update Method
 Mixedinteger Convex Representability
 High Degree Sum of Squares Proofs, BienstockZuckerberg Hierarchy and ChvatalGomory Cuts
 Enumeration of Integer Points in Projections of Unbounded Polyhedral
 Excluded tfactors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2matchings
 Equilibrium Computation in Atomic Splittable Singleton Congestion Games.
 Isbn
 9783319592503
 Label
 Integer Programming and Combinatorial Optimization : 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 2628, 2017, Proceedings
 Title
 Integer Programming and Combinatorial Optimization
 Title remainder
 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 2628, 2017, Proceedings
 Statement of responsibility
 edited by Friedrich Eisenbrand, Jochen Koenemann
 Subject

 Computer Science
 Algorithm Analysis and Problem Complexity
 Discrete Mathematics in Computer Science
 Numeric Computing
 Computer networks
 Computer science
 Numerical analysis
 Artificial intelligence
 Computer Communication Networks
 Computer science  Mathematics
 Algorithms
 Artificial Intelligence (incl. Robotics)
 Language
 eng
 Summary
 This book constitutes the refereed proceedings of the 19th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2017, held in Waterloo, IN, Canada, in June 2017. The 36 full papers presented were carefully reviewed and selected from 125 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems
 Cataloging source
 UPM
 Dewey number
 518
 Index
 no index present
 LC call number
 QA297299.4
 Literary form
 non fiction
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorName

 Eisenbrand, Friedrich.
 Koenemann, Jochen.
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 10328
 http://library.link/vocab/subjectName

 Computer science
 Computer networks
 Algorithms
 Numerical analysis
 Computer science
 Artificial intelligence
 Computer Science
 Numeric Computing
 Algorithm Analysis and Problem Complexity
 Discrete Mathematics in Computer Science
 Computer Communication Networks
 Artificial Intelligence (incl. Robotics)
 Label
 Integer Programming and Combinatorial Optimization : 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 2628, 2017, Proceedings, edited by Friedrich Eisenbrand, Jochen Koenemann, (electronic book)
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 Contents
 The Twopoint Fano and Ideal Binary Clutters  On Scheduling Coflows  Integrality Gaps of Integer Knapsack Problems  An Improved Integrality Gap for the CalinescuKarloffRabani Relaxation for Multiway Cut  Approximation of Corner Polyhedra with Families of Intersection Cuts  The Structure of the Infinite Models in Integer Programming  Mixedinteger Linear Representability, Disjunctions, and Variable Elimination  Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time  Cutting Planes from Wide Split Disjunctions  The Salesman's Improved Tours for Fundamental Classes  The Heterogeneous Capacitated kCenter Problem  Local Guarantees in Graph Cuts and Clustering  Verifying Integer Programming Results  Long term Behavior of Dynamic Equilibria in uid Queuing Networks  A 4/5  Approximation Algorithm for the Maximum Traveling Salesman Problem  Minimizing Multimodular Functions and Allocating Capacity in Bikesharing Systems  Compact, ProvablyGood LPs for Orienteering and RegretBounded Vehicle Routing  Discrete Newton's Algorithm for Parametric Submodular Function Minimization  Stochastic Online Scheduling on Unrelated Machines  Online Matroid Intersection: Beating Half for Random Arrival  Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector  An Improved Deterministic Rescaling for Linear Programming Algorithms  MinMax Theorems for Packing and Covering Odd (u; v)trails  Breaking 1  1/e Barrier for Nonpreemptive Throughput Maximization  A QuasiPolynomial Approximation for the Restricted Assignment Problem  Adaptive Submodular Ranking  On the Notions of Facets, Weak Facets, and Extreme Functions of the GomoryJohnson Infinite Group Problem  Minimum Birkhoffvon Neumann Decomposition  Maximum Matching in the Online BatchArrival Model  Budget Feasible Mechanisms on Matroids  Deterministic Discrepancy Minimization Via the Multiplicative Weight Update Method  Mixedinteger Convex Representability  High Degree Sum of Squares Proofs, BienstockZuckerberg Hierarchy and ChvatalGomory Cuts  Enumeration of Integer Points in Projections of Unbounded Polyhedral  Excluded tfactors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2matchings  Equilibrium Computation in Atomic Splittable Singleton Congestion Games.
 Dimensions
 unknown
 Extent
 1 online resource (XI, 456 p. 34 illus.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783319592503
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/9783319592503
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 ocn992859593
 Label
 Integer Programming and Combinatorial Optimization : 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 2628, 2017, Proceedings, edited by Friedrich Eisenbrand, Jochen Koenemann, (electronic book)
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 Contents
 The Twopoint Fano and Ideal Binary Clutters  On Scheduling Coflows  Integrality Gaps of Integer Knapsack Problems  An Improved Integrality Gap for the CalinescuKarloffRabani Relaxation for Multiway Cut  Approximation of Corner Polyhedra with Families of Intersection Cuts  The Structure of the Infinite Models in Integer Programming  Mixedinteger Linear Representability, Disjunctions, and Variable Elimination  Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time  Cutting Planes from Wide Split Disjunctions  The Salesman's Improved Tours for Fundamental Classes  The Heterogeneous Capacitated kCenter Problem  Local Guarantees in Graph Cuts and Clustering  Verifying Integer Programming Results  Long term Behavior of Dynamic Equilibria in uid Queuing Networks  A 4/5  Approximation Algorithm for the Maximum Traveling Salesman Problem  Minimizing Multimodular Functions and Allocating Capacity in Bikesharing Systems  Compact, ProvablyGood LPs for Orienteering and RegretBounded Vehicle Routing  Discrete Newton's Algorithm for Parametric Submodular Function Minimization  Stochastic Online Scheduling on Unrelated Machines  Online Matroid Intersection: Beating Half for Random Arrival  Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector  An Improved Deterministic Rescaling for Linear Programming Algorithms  MinMax Theorems for Packing and Covering Odd (u; v)trails  Breaking 1  1/e Barrier for Nonpreemptive Throughput Maximization  A QuasiPolynomial Approximation for the Restricted Assignment Problem  Adaptive Submodular Ranking  On the Notions of Facets, Weak Facets, and Extreme Functions of the GomoryJohnson Infinite Group Problem  Minimum Birkhoffvon Neumann Decomposition  Maximum Matching in the Online BatchArrival Model  Budget Feasible Mechanisms on Matroids  Deterministic Discrepancy Minimization Via the Multiplicative Weight Update Method  Mixedinteger Convex Representability  High Degree Sum of Squares Proofs, BienstockZuckerberg Hierarchy and ChvatalGomory Cuts  Enumeration of Integer Points in Projections of Unbounded Polyhedral  Excluded tfactors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2matchings  Equilibrium Computation in Atomic Splittable Singleton Congestion Games.
 Dimensions
 unknown
 Extent
 1 online resource (XI, 456 p. 34 illus.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783319592503
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/9783319592503
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 ocn992859593
Subject
 Algorithm Analysis and Problem Complexity
 Algorithms
 Artificial Intelligence (incl. Robotics)
 Artificial intelligence
 Computer Communication Networks
 Computer Science
 Computer networks
 Computer science
 Computer science  Mathematics
 Discrete Mathematics in Computer Science
 Numeric Computing
 Numerical analysis
Member of
Library Links
Embed (Experimental)
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.liverpool.ac.uk/portal/IntegerProgrammingandCombinatorial/bKTkzN89xSE/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.liverpool.ac.uk/portal/IntegerProgrammingandCombinatorial/bKTkzN89xSE/">Integer Programming and Combinatorial Optimization : 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 2628, 2017, Proceedings, edited by Friedrich Eisenbrand, Jochen Koenemann, (electronic book)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.liverpool.ac.uk/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.liverpool.ac.uk/">University of Liverpool</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 : 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 2628, 2017, Proceedings, edited by Friedrich Eisenbrand, Jochen Koenemann, (electronic book)
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.liverpool.ac.uk/portal/IntegerProgrammingandCombinatorial/bKTkzN89xSE/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.liverpool.ac.uk/portal/IntegerProgrammingandCombinatorial/bKTkzN89xSE/">Integer Programming and Combinatorial Optimization : 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 2628, 2017, Proceedings, edited by Friedrich Eisenbrand, Jochen Koenemann, (electronic book)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.liverpool.ac.uk/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.liverpool.ac.uk/">University of Liverpool</a></span></span></span></span></div>