000			03202nam a22004575i 4500
999			_c330820 _d330820 _x1
001			330820
003			ES-MaUEC
005			20240111050209.0
006			a||||fo|||| 00| 0
007			cr nn nnnaamaa
008			210208s2021 gw | s |||| 0|eng d
020			_a9783030639204
024	7		_a10.1007/978-3-030-63920-4 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _erda _dES-MaUEC
050		4	_aQA402.5 _b2021 EB
100	1		_aMankowski, Michal _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9677857
245	1	0	_aDynamic Programming Multi-Objective Combinatorial Optimization _cby Michal Mankowski, Mikhail Moshkov.
250			_aFirst edition 2021
264		1	_aCham _bSpringer International Pulishing _c2021
300			_a1 recurso en línea (XIV, 214 páginas) _b67 illus
336			_2rdacontent _aTexto _btxt
337			_2rdamedia _aelectrónico _bc
338			_2rdacarrier _arecurso electrónico _bcr
347			_atext file _bPDF _2
490	0		_aStudies in Systems Decision and Control _x2198-4182 _v331
490	0		_aIntelligent Technologies and Robotics (SpringerNature-42732)
490	0		_aIntelligent Technologies and Robotics (R0) (SpringerNature-43728)
505	0		_aIntroduction -- Circuits Without Repetitions. Main Tools -- Combinatorial Optimization Problems. Conventional Circuits -- Multi-Stage and Bi-Criteria Optimization of Matchings in Trees -- Combinatorial Optimization Problems. Syntactical Circuits -- Index.
520	3		_aThis book introduces a fairly universal approach to the design and analysis of exact optimization algorithms for multi-objective combinatorial optimization problems. It proposes the circuits without repetitions representing the sets of feasible solutions along with the increasing and strictly increasing cost functions as a model for such problems. The book designs the algorithms for multi-stage and bi-criteria optimization and for counting the solutions in the framework of this model. As applications, this book studies eleven known combinatorial optimization problems: matrix chain multiplication, global sequence alignment, optimal paths in directed graphs, binary search trees, convex polygon triangulation, line breaking (text justification), one-dimensional clustering, optimal bitonic tour, segmented least squares, optimization of matchings in trees, and 0/1 knapsack problem. The results presented are useful for researchers in combinatorial optimization. This book is also useful as the basis for graduate courses.
988			_aSpringer_Robotics_2021
650		7	_aOptimización combinatoria _2embne _9157651
650		7	_aProgramación de ordenadores _2embne _9139821
650		7	_aInteligencia artificial _2embne _9413115
700	1		_aMoshkov, Mikhail _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9673658
776	0	8	_iPrinted edition: _z9783030639198
776	0	8	_iPrinted edition: _z9783030639211
776	0	8	_iPrinted edition: _z9783030639228
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-030-63920-4 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE _n0
998			_b03/2021 _dz _eo _zSI