000 05208nam a22005895i 4500
001 978-3-319-33461-5
003 DE-He213
005 20240423125206.0
007 cr nn 008mamaa
008 160524s2016 sz | s |||| 0|eng d
020 _a9783319334615
_9978-3-319-33461-5
024 7 _a10.1007/978-3-319-33461-5
_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] :
_b18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings /
_cedited by Quentin Louveaux, Martin Skutella.
250 _a1st ed. 2016.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2016.
300 _aXIII, 412 p. 33 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 ;
_v9682
505 0 _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. .
520 _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.
650 0 _aNumerical analysis.
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aComputer networks .
650 1 4 _aNumerical Analysis.
650 2 4 _aAlgorithms.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputer Communication Networks.
700 1 _aLouveaux, Quentin.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSkutella, Martin.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319334608
776 0 8 _iPrinted edition:
_z9783319334622
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v9682
856 4 0 _uhttps://doi.org/10.1007/978-3-319-33461-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c175259
_d175259