Integer programming and combinatorial optimization : 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 2628, 2017, proceedings
 Responsibility
 Friedrich Eisenbrand, Jochen Koenemann (Eds.).
 Digital
 text file
 Publication
 Cham, Switzerland : Springer, [2017]
 Physical description
 1 online resource
 Series
 Lecture notes in computer science ; 10328. 03029743
Online
More options
Description
Creators/Contributors
 Meeting
 Conference on Integer Programming and Combinatorial Optimization (19th : 2017 : Waterloo, Ont.)
 Contributor
 Eisenbrand, Friedrich, editor.
 Koenemann, Jochen, editor.
Contents/Summary
 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. .
 (source: Nielsen Book Data)
 Publisher's 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.
(source: Nielsen Book Data)
Subjects
 Subjects
 Integer programming > Congresses.
 Combinatorial optimization > Congresses.
 Algorithms & data structures.
 Discrete mathematics.
 Network hardware.
 Artificial intelligence.
 Mathematical theory of computation.
 Computers > Programming > Algorithms.
 Computers > Data Processing.
 Computers > Hardware > Network Hardware.
 Computers > Intelligence (AI) & Semantics.
 Integer programming.
 Combinatorial optimization.
 Algorithms.
 Computer networks.
 Computer science.
 Computer science > Mathematics.
 Numerical analysis.
Bibliographic information
 Publication date
 2017
 Title variation
 IPCO 2017
 Series
 Lecture notes in computer science ; 10328
 Note
 Includes index.
 ISBN
 9783319592503 (electronic book)
 3319592505 (electronic book)
 9783319592497
 3319592491
 DOI
 10.1007/9783319592503