LEADER 05377nam 22006855 450 001 996465776403316 005 20230330065118.0 010 $a3-319-33461-1 024 7 $a10.1007/978-3-319-33461-5 035 $a(CKB)3710000000711657 035 $a(DE-He213)978-3-319-33461-5 035 $a(MiAaPQ)EBC6303211 035 $a(MiAaPQ)EBC5588070 035 $a(Au-PeEL)EBL5588070 035 $a(OCoLC)951213986 035 $a(PPN)194076830 035 $a(EXLCZ)993710000000711657 100 $a20160524d2016 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aInteger Programming and Combinatorial Optimization$b[electronic resource] $e18th International Conference, IPCO 2016, Ličge, Belgium, June 1-3, 2016, Proceedings /$fedited by Quentin Louveaux, Martin Skutella 205 $a1st ed. 2016. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2016. 215 $a1 online resource (XIII, 412 p. 33 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9682 311 $a3-319-33460-3 327 $aOn Approximation Algorithms for Concave Mixed-Integer QuadraticProgramming -- Centerpoints: A link between optimization and convex geometry -- Rescaled coordinate descent methods for Linear Programming -- Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems -- Max-Cut under Graph Constraints -- Sparsest cut in planar graphs, maximum concurrent ows and their connections with the max-cut problem -- Intersection Cuts for Bilevel Optimization -- Exact Algorithms for the Chance-Constrained Vehicle Routing Problem -- Extended Formulations in Mixed-integer Convex Programming -- k-Trails: Recognition, Complexity, and Approximations -- Better s-t-Tours by Gao Trees -- Popular Edges and Dominant Matchings -- Semidefinite and linear programming integrality gaps for scheduling identical machines -- Stabilizing network bargaining games by blocking players -- Round Robin Tournaments Generated by the Circle Method have Maximum Carry-Over -- Extreme Functions with an Arbitrary Number of Slopes -- Minimal cut-generating functions are nearly extreme -- On the Mixed Binary Representability of Ellipsoidal Regions -- Constant Factor Approximation for ATSP with Two Edge Weights -- Improved Approximation Algorithms for Hitting 3-Vertex Paths -- Improved Approximations for Cubic Bipartite and Cubic TSP -- An approximation algorithm for Uniform Capacitated k-Median problem with 1 + ? capacity violation -- Valid Inequalities for Separable Concave Constraints with Indicator Variables -- A Polyhedral Approach to Online Bipartite Matching -- On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank -- Robust Monotone Submodular Function Maximization -- Maximizing Monotone Submodular Functions over the Integer Lattice -- Submodular Unsplittable Flow on Trees -- Strong reductions for extended formulations -- Sum-of-squares lower bounds for maximally symmetric formulations -- Sum-of-squares lower bounds for maximally symmetric formulations -- Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point -- On the quantile cut closure of chance-constrained problems. . 330 $aThis book constitutes the refereed proceedings of the 18th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2016, held in Ličge, Belgium, in June 2016. The 33 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9682 606 $aNumerical analysis 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer networks 606 $aNumerical Analysis 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Communication Networks 615 0$aNumerical analysis. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer networks. 615 14$aNumerical Analysis. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Communication Networks. 676 $a519.77 702 $aLouveaux$b Quentin$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSkutella$b Martin$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465776403316 996 $aInteger Programming and Combinatorial Optimization$92860150 997 $aUNISA