000790246 000__ 05101cam\a2200517Mi\4500
000790246 001__ 790246
000790246 005__ 20230306143405.0
000790246 006__ m\\\\\o\\d\\\\\\\\
000790246 007__ cr\nn\nnnunnun
000790246 008__ 170523s2017\\\\gw\\\\\\o\\\\\000\0\eng\d
000790246 019__ $$a990176335$$a992503042
000790246 020__ $$a9783319592503
000790246 020__ $$a3319592505
000790246 020__ $$z9783319592497
000790246 0247_ $$a10.1007/978-3-319-59250-3$$2doi
000790246 035__ $$aSP(OCoLC)ocn992859593
000790246 035__ $$aSP(OCoLC)992859593$$z(OCoLC)990176335$$z(OCoLC)992503042
000790246 040__ $$aUPM$$beng$$cUPM$$dOCLCO$$dGW5XE$$dAZU$$dUAB
000790246 049__ $$aISEA
000790246 050_4 $$aQA297-299.4
000790246 08204 $$a518$$223
000790246 24500 $$aInteger Programming and Combinatorial Optimization :$$b19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings /$$cedited by Friedrich Eisenbrand, Jochen Koenemann.
000790246 264_1 $$aCham :$$bSpringer International Publishing :$$bImprint: Springer,$$c2017.
000790246 300__ $$a1 online resource (xi, 456 pages) :$$billustrations.
000790246 336__ $$atext$$btxt$$2rdacontent
000790246 337__ $$acomputer$$bc$$2rdamedia
000790246 338__ $$aonline resource$$bcr$$2rdacarrier
000790246 347__ $$atext file$$bPDF$$2rda
000790246 4901_ $$aLecture Notes in Computer Science,$$x0302-9743 ;$$v10328
000790246 5050_ $$aThe 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. .
000790246 506__ $$aAccess limited to authorized users.
000790246 520__ $$aThis 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.
000790246 650_0 $$aComputer science.
000790246 650_0 $$aComputer networks.
000790246 650_0 $$aAlgorithms.
000790246 650_0 $$aNumerical analysis.
000790246 650_0 $$aComputer science$$xMathematics.
000790246 650_0 $$aArtificial intelligence.
000790246 7001_ $$aEisenbrand, Friedrich.$$eeditor.
000790246 7001_ $$aKoenemann, Jochen.$$eeditor.
000790246 77608 $$iPrint version:$$z9783319592497
000790246 830_0 $$aLecture notes in computer science ;$$v10328.
000790246 852__ $$bebk
000790246 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-59250-3$$zOnline Access$$91397441.1
000790246 909CO $$ooai:library.usi.edu:790246$$pGLOBAL_SET
000790246 980__ $$aEBOOK
000790246 980__ $$aBIB
000790246 982__ $$aEbook
000790246 983__ $$aOnline
000790246 994__ $$a92$$bISE