國立虎尾科技大學 |

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization

Record Type:	Language materials, printed : Monograph/item
Title/Author:	A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization/ by Stefan Rocktäschel.
Author:	Rocktäschel, Stefan.
Description:	VIII, 70 p. 15 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computational Mathematics and Numerical Analysis. -
Online resource:	https://doi.org/10.1007/978-3-658-29149-5
ISBN:	9783658291495

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Rocktäschel, Stefan.

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization[electronic resource] /by Stefan Rocktäschel. - 1st ed. 2020. - VIII, 70 p. 15 illus.online resource. - BestMasters,2625-3577. - BestMasters,.

Theoretical basics for solving multiobjective mixed-integer convex optimization problems -- An algorithm for solving this class of optimization problems -- Test instances and numerical results.

Stefan Rocktäschel introduces a branch-and-bound algorithm that determines a cover of the efficient set of multiobjective mixed-integer convex optimization problems. He examines particular steps of this algorithm in detail and enhances the basic algorithm with additional modifications that ensure a more precise cover of the efficient set. Finally, he gives numerical results on some test instances. Contents Theoretical basics for solving multiobjective mixed-integer convex optimization problems An algorithm for solving this class of optimization problems Test instances and numerical results Target Groups Students and Lecturers in the field of mathematics and economics Practitioners in the field of multiobjective mixed-integer convex optimization problems The Author Stefan Rocktäschel works as scientific assistant at the Institute for Mathematics of Technische Universität Ilmenau, Germany.

ISBN: 9783658291495

Standard No.: 10.1007/978-3-658-29149-5doiSubjects--Topical Terms:

669338
Computational Mathematics and Numerical Analysis.

LC Class. No.: T57-57.97

Dewey Class. No.: 519

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
LDR:02469nam a22003975i 4500 001 1018700
003 DE-He213
005 20200629135434.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783658291495 $9 978-3-658-29149-5
024 7 $a 10.1007/978-3-658-29149-5 $2 doi
035 $a 978-3-658-29149-5
050 4 $a T57-57.97
072 7 $a PBW $2 bicssc
072 7 $a MAT003000 $2 bisacsh
072 7 $a PBW $2 thema
082 0 4 $a 519 $2 23
100 1 $a Rocktäschel, Stefan. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1313770
245 1 2 $a A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization $h [electronic resource] / $c by Stefan Rocktäschel.
250 $a 1st ed. 2020.
264 1 $a Wiesbaden : $b Springer Fachmedien Wiesbaden : $b Imprint: Springer Spektrum, $c 2020.
300 $a VIII, 70 p. 15 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a BestMasters, $x 2625-3577
505 0 $a Theoretical basics for solving multiobjective mixed-integer convex optimization problems -- An algorithm for solving this class of optimization problems -- Test instances and numerical results.
520 $a Stefan Rocktäschel introduces a branch-and-bound algorithm that determines a cover of the efficient set of multiobjective mixed-integer convex optimization problems. He examines particular steps of this algorithm in detail and enhances the basic algorithm with additional modifications that ensure a more precise cover of the efficient set. Finally, he gives numerical results on some test instances. Contents Theoretical basics for solving multiobjective mixed-integer convex optimization problems An algorithm for solving this class of optimization problems Test instances and numerical results Target Groups Students and Lecturers in the field of mathematics and economics Practitioners in the field of multiobjective mixed-integer convex optimization problems The Author Stefan Rocktäschel works as scientific assistant at the Institute for Mathematics of Technische Universität Ilmenau, Germany.
650 2 4 $a Computational Mathematics and Numerical Analysis. $3 669338
650 1 4 $a Applications of Mathematics. $3 669175
650 0 $a Computer mathematics. $3 1199796
650 0 $a Engineering mathematics. $3 562757
650 0 $a Applied mathematics. $3 1069907
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783658291488
776 0 8 $i Printed edition: $z 9783658291501
830 0 $a BestMasters, $x 2625-3577 $3 1253531
856 4 0 $u https://doi.org/10.1007/978-3-658-29149-5
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)