000			03434nam a22004815i 4500
001			978-0-387-09414-4
003			DE-He213
005			20260127104638.0
007			cr nn 008mamaa
008			100301s2009 xxu| s |||| 0|eng d
020			_a9780387094144
020			_a99780387094144
024	7		_a10.1007/978-0-387-09414-4 _2doi
040			_cCICY
100	1		_aLasserre, Jean-Bernard. _eauthor.
245	1	0	_aLinear and Integer Programming vs Linear Integration and Counting _h[recurso electrónico] : _bA Duality Viewpoint / _cby Jean-Bernard Lasserre.
264		1	_aNew York, NY : _bSpringer New York, _c2009.
300			_bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aSpringer Series in Operations Research and Financial Engineering, _x1431-8598
505	0		_aI Linear Integration and Linear Programming -- The Linear Integration Problem I -- Comparing the Continuous Problems P and I -- II Linear Counting and Integer Programming -- The Linear Counting Problem I -- Relating the Discrete Problems P and I with P -- III Duality -- Duality and Gomory Relaxations -- Barvinok's Counting Algorithm and Gomory Relaxations -- A Discrete Farkas Lemma -- The Integer Hull of a Convex Rational Polytope -- Duality and Superadditive Functions.
520			_aIn this book the author analyzes and compares four closely related problems, namely linear programming, integer programming, linear integration, linear summation (or counting). The focus is on duality and the approach is rather novel as it puts integer programming in perspective with three associated problems, and permits one to define discrete analogues of well-known continuous duality concepts, and the rationale behind them. Also, the approach highlights the difference between the discrete and continuous cases. Central in the analysis are the continuous and discrete Brion and Vergne's formulae for linear integration and counting. This approach provides some new insights on duality concepts for integer programs, and also permits to retrieve and shed new light on some well-known results. For instance, Gomory relaxations and the abstract superadditive dual of integer programs are re-interpreted in this algebraic approach. This book will serve graduate students and researchers in applied mathematics, optimization, operations research and computer science. Due to the substantial practical importance of some presented problems, researchers in other areas will also find this book useful.
650		0	_aMATHEMATICS.
650		0	_aCOMPUTATIONAL COMPLEXITY.
650		0	_aDISCRETE GROUPS.
650		0	_aMATHEMATICAL OPTIMIZATION.
650		0	_aOPERATIONS RESEARCH.
650	1	4	_aMATHEMATICS.
650	2	4	_aCONVEX AND DISCRETE GEOMETRY.
650	2	4	_aDISCRETE MATHEMATICS IN COMPUTER SCIENCE.
650	2	4	_aOPTIMIZATION.
650	2	4	_aOPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9780387094137
830		0	_aSpringer Series in Operations Research and Financial Engineering, _x1431-8598
856	4	0	_uhttp://dx.doi.org/10.1007/978-0-387-09414-4 _zVer el texto completo en las instalaciones del CICY
942			_2ddc _cER
999			_c55908 _d55908