東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

A branch-and-bound algorithm for mul...

Rocktaschel, Stefan.

Linked to FindBook

Google Book

Amazon

博客來

A branch-and-bound algorithm for multiobjective mixed-integer convex optimization

Record Type:	Electronic resources : Monograph/item
Title/Author:	A branch-and-bound algorithm for multiobjective mixed-integer convex optimization/ by Stefan Rocktaschel.
Author:	Rocktaschel, Stefan.
Published:	Wiesbaden :Springer Fachmedien Wiesbaden : : 2020.,
Description:	viii, 70 p. :ill., digital ;24 cm.
[NT 15003449]:	Theoretical basics for solving multiobjective mixed-integer convex optimization problems -- An algorithm for solving this class of optimization problems -- Test instances and numerical results.
Contained By:	Springer eBooks
Subject:	Mathematical optimization. -
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
Rocktaschel, Stefan.

A branch-and-bound algorithm for multiobjective mixed-integer convex optimization[electronic resource] /by Stefan Rocktaschel. - Wiesbaden :Springer Fachmedien Wiesbaden :2020. - viii, 70 p. :ill., digital ;24 cm. - 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 Rocktaschel 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 Rocktaschel works as scientific assistant at the Institute for Mathematics of Technische Universitat Ilmenau, Germany.

ISBN: 9783658291495

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

517763
Mathematical optimization.

LC Class. No.: QA402.5 / .R635 2020

Dewey Class. No.: 519.6

A branch-and-bound algorithm for multiobjective mixed-integer convex optimization
LDR:02140nmm a2200337 a 4500 001 2215795
003 DE-He213
005 20200624173056.0
006 m d
007 cr nn 008maaau
008 201120s2020 gw s 0 eng d
020 $a 9783658291495 $q (electronic bk.)
020 $a 9783658291488 $q (paper)
024 7 $a 10.1007/978-3-658-29149-5 $2 doi
035 $a 978-3-658-29149-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA402.5 $b .R635 2020
072 7 $a PBW $2 bicssc
072 7 $a MAT003000 $2 bisacsh
072 7 $a PBW $2 thema
082 0 4 $a 519.6 $2 23
090 $a QA402.5 $b .R683 2020
100 1 $a Rocktaschel, Stefan. $3 3447620
245 1 2 $a A branch-and-bound algorithm for multiobjective mixed-integer convex optimization $h [electronic resource] / $c by Stefan Rocktaschel.
260 $a Wiesbaden : $b Springer Fachmedien Wiesbaden : $b Imprint: Springer Spektrum, $c 2020.
300 $a viii, 70 p. : $b ill., digital ; $c 24 cm.
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 Rocktaschel 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 Rocktaschel works as scientific assistant at the Institute for Mathematics of Technische Universitat Ilmenau, Germany.
650 0 $a Mathematical optimization. $3 517763
650 1 4 $a Applications of Mathematics. $3 890893
650 2 4 $a Computational Mathematics and Numerical Analysis. $3 891040
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a BestMasters. $3 2056364
856 4 0 $u https://doi.org/10.1007/978-3-658-29149-5
950 $a Mathematics and Statistics (Springer-11649)