Integer Programming and Combinatorial Optimization : 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 2628, 2017, proceedings /: 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 2628, 2017, proceedings. (2017)

• Record Type: Book
• Further Information: Note: Edited by Friedrich Eisenbrand, Jochen Koenemann.
• Editors: Koenemann, Jochen; Eisenbrand, Friedrich
• Other Names: Conference on Integer Programming and Combinatorial Optimization, 10th
• Contents: The Two-point Fano and Ideal Binary Clutters -- On Scheduling Coflows -- Integrality Gaps of Integer Knapsack Problems -- An Improved Integrality Gap for the Calinescu-Karloff-Rabani Relaxation for Multiway Cut -- Approximation of Corner Polyhedra with Families of Intersection Cuts -- The Structure of the Infinite Models in Integer Programming -- Mixed-integer 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 k-Center 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 Bike-sharing Systems -- Compact, Provably-Good LPs for Orienteering and Regret-Bounded 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 -- Min-Max Theorems for Packing and Covering Odd (u; v)-trails -- Breaking 1 -- 1/e Barrier for Non-preemptive Throughput Maximization -- A Quasi-Polynomial Approximation for the Restricted Assignment Problem -- Adaptive Submodular Ranking -- On the Notions of Facets, Weak Facets, and Extreme Functions of the Gomory-Johnson Infinite Group Problem -- Minimum Birkhoff-von Neumann Decomposition -- Maximum Matching in the Online Batch-Arrival Model -- Budget Feasible Mechanisms on Matroids -- Deterministic Discrepancy Minimization Via the Multiplicative Weight Update Method -- Mixed-integer Convex Representability -- High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and Chvatal-Gomory Cuts -- Enumeration of Integer Points in Projections of Unbounded Polyhedral -- Excluded t-factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-matchings -- Equilibrium Computation in Atomic Splittable Singleton Congestion Games.
• Publisher Details: Cham : Springer
• Publication Date: 2017
• Extent: 1 online resource (xi, 456 pages), illustrations
• Subjects: 519.77; Computer science; Numerical analysis -- Congresses; Integer programming -- Congresses; Computer science -- Mathematics; Combinatorial optimization -- Congresses; Electronic data processing; Computer software; Computational complexity; Computer Communication Networks; Artificial intelligence; Combinatorial optimization; Computer science -- Mathematics; Integer programming; Numerical analysis; Computers -- Programming -- Algorithms; Computers -- Data Processing; Computers -- Hardware -- Network Hardware; Computers -- Intelligence (AI) & Semantics; Algorithms & data structures; Discrete mathematics; Network hardware; Artificial intelligence; Mathematical theory of computation; Electronic books; Conference papers and proceedings
• Languages: English
• ISBNs: 9783319592497; 3319592491; 9783319592503; 3319592505
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.