000 | 03516nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-642-36694-9 | ||
003 | DE-He213 | ||
005 | 20240730190842.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 |
_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] : _b16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings / _cedited by Michel Goemans, José Correa. |
250 | _a1st ed. 2013. | ||
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 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _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 |
_aNumerical analysis. _94603 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aDiscrete mathematics. _912873 |
|
650 | 0 |
_aComputer science. _99832 |
|
650 | 1 | 4 |
_aNumerical Analysis. _94603 |
650 | 2 | 4 |
_aAlgorithms. _93390 |
650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
650 | 2 | 4 |
_aComputer Science. _99832 |
700 | 1 |
_aGoemans, Michel. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9144171 |
|
700 | 1 |
_aCorrea, José. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9144172 |
|
710 | 2 |
_aSpringerLink (Online service) _9144173 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783642366932 |
776 | 0 | 8 |
_iPrinted edition: _z9783642366956 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v7801 _9144174 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-36694-9 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c93482 _d93482 |