LEADER 03797nam  22007335  450 
001 996465623303316
005 20230329171451.0
010   $a3-642-36694-5
024 7 $a10.1007/978-3-642-36694-9
035   $a(CKB)3280000000007554
035   $a(DE-He213)978-3-642-36694-9
035   $a(SSID)ssj0000880020
035   $a(PQKBManifestationID)11466214
035   $a(PQKBTitleCode)TC0000880020
035   $a(PQKBWorkID)10853299
035   $a(PQKB)10881269
035   $a(MiAaPQ)EBC3093373
035   $a(PPN)169139549
035   $a(EXLCZ)993280000000007554
100   $a20130321d2013      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] $e16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings /$fedited by Michel Goemans, José Correa
205   $a1st ed. 2013.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2013.
215   $a1 online resource (XII, 400 p. 32 illus.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7801
300   $aInternational conference proceedings.
311   $a3-642-36693-7 
320   $aIncludes bibliographical references and index.
327   $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.
330   $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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7801
606   $aNumerical analysis
606   $aAlgorithms
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aComputer science
606   $aNumerical Analysis
606   $aAlgorithms
606   $aDiscrete Mathematics in Computer Science
606   $aComputer Science
615  0$aNumerical analysis.
615  0$aAlgorithms.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aComputer science.
615 14$aNumerical Analysis.
615 24$aAlgorithms.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aComputer Science.
676   $a519.77
702   $aGoemans$b Michel$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aCorrea$b José$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996465623303316
996   $aInteger Programming and Combinatorial Optimization$92860150
997   $aUNISA