000 03307nam a22005535i 4500
001 978-3-642-36694-9
003 DE-He213
005 20160624102224.0
007 cr nn 008mamaa
008 130321s2013 gw | s |||| 0|eng d
020 _a9783642366949
_9978-3-642-36694-9
024 7 _a10.1007/978-3-642-36694-9
_2doi
050 4 _aQA297-299.4
072 7 _aUYA
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a518
_223
245 1 0 _aInteger Programming and Combinatorial Optimization
_h[electronic resource] :
_b16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings /
_cedited by Michel Goemans, José Correa.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _aXII, 400 p. 32 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7801
505 0 _aOn the Structure of Reduced Kernel Lattice Bases -- Constant Integrality Gap LP formulations of Unsplittable Flow on a Path -- Content Placement via the Exponential Potential Function Method -- Blocking Optimal Arborescences -- Matroid and Knapsack Center Problems -- On Some Generalizations of the Split Closure -- An Improved Integrality Gap for Asymmetric TSP Paths -- Two Dimensional Optimal Mechanism Design for a Sequencing Problem -- The Euclidean k-Supplier Problem.
520 _aThis book constitutes the proceedings of the 16th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2013, held in Valparaíso, Chile, in March 2013. The 33 full papers presented were carefully reviewed and selected from 98 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization with the aim to present recent developments in theory, computation, and applications. 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 _aComputer science.
650 0 _aComputer software.
650 0 _aElectronic data processing.
650 0 _aComputational complexity.
650 1 4 _aComputer Science.
650 2 4 _aNumeric Computing.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputer Science, general.
650 2 4 _aComputer Science, general.
650 2 4 _aComputer Science, general.
700 1 _aGoemans, Michel.
_eeditor.
700 1 _aCorrea, José.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642366932
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7801
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-36694-9
942 _2EBK10729
_cEBK
999 _c40023
_d40023