000 05610nam a22006135i 4500
001 978-3-319-59250-3
003 DE-He213
005 20240730195309.0
007 cr nn 008mamaa
008 170523s2017 sz | s |||| 0|eng d
020 _a9783319592503
_9978-3-319-59250-3
024 7 _a10.1007/978-3-319-59250-3
_2doi
050 4 _aQA297-299.4
072 7 _aPBKS
_2bicssc
072 7 _aMAT041000
_2bisacsh
072 7 _aPBKS
_2thema
082 0 4 _a518
_223
245 1 0 _aInteger Programming and Combinatorial Optimization
_h[electronic resource] :
_b19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings /
_cedited by Friedrich Eisenbrand, Jochen Koenemann.
250 _a1st ed. 2017.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2017.
300 _aXI, 456 p. 34 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v10328
505 0 _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-integerConvex 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. .
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.
650 0 _aNumerical analysis.
_94603
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aComputer networks .
_931572
650 0 _aArtificial intelligence.
_93407
650 1 4 _aNumerical Analysis.
_94603
650 2 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aComputer Communication Networks.
_9159793
650 2 4 _aArtificial Intelligence.
_93407
700 1 _aEisenbrand, Friedrich.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9159794
700 1 _aKoenemann, Jochen.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9159795
710 2 _aSpringerLink (Online service)
_9159796
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319592497
776 0 8 _iPrinted edition:
_z9783319592510
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v10328
_9159797
856 4 0 _uhttps://doi.org/10.1007/978-3-319-59250-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c95565
_d95565