Items related to A Branch-and-Bound Algorithm for Multiobjective Mixed-intege...
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization (BestMasters) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
About the Author
Stefan Rocktäschel works as scientific assistant at the Institute for Mathematics of Technische Universität Ilmenau, Germany.
From the Back Cover
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 forMathematics of Technische Universität Ilmenau, Germany.
"About this title" may belong to another edition of this title.
- PublisherSpringer
- Publication date2020
- ISBN 10 3658291486
- ISBN 13 9783658291488
- BindingPaperback
- LanguageEnglish
- Edition number1
- Number of pages78
Buy New
View this item
US$ 63.56
US$ 26.54 shipping from Germany to U.S.A.
Destination, rates & speedsSearch results for A Branch-and-Bound Algorithm for Multiobjective Mixed-intege...
Seller Image
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Published by
Springer Fachmedien Wiesbaden Jan 2020, 2020
ISBN 10: 3658291486
ISBN 13: 9783658291488
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 80 pp. Englisch. Seller Inventory # 9783658291488
Quantity: 2 available
Stock Image
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization (BestMasters)
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 78. Seller Inventory # 26380616358
Quantity: 4 available
Seller Image
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Published by
Springer Fachmedien Wiesbaden, 2020
ISBN 10: 3658291486
ISBN 13: 9783658291488
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783658291488
Quantity: 1 available
Stock Image
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization (BestMasters)
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Print on Demand pp. 78. Seller Inventory # 383254905
Quantity: 4 available
Stock Image
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization (BestMasters)
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 78. Seller Inventory # 18380616364
Quantity: 4 available
Seller Image
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Published by
Springer Fachmedien Wiesbaden, 2020
ISBN 10: 3658291486
ISBN 13: 9783658291488
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. First algorithm for solving multiobjective mixed-integer convex optimization problemsTheoretical basics for solving multiobjective mixed-integer convex optimization problems.- An algorithm for solving this class of optimization problems.- Test instances. Seller Inventory # 385765505
Quantity: Over 20 available
Seller Image
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Published by
Springer Fachmedien Wiesbaden, Springer Fachmedien Wiesbaden Jan 2020, 2020
ISBN 10: 3658291486
ISBN 13: 9783658291488
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Neuware -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.Springer Spektrum in Springer Science + Business Media, Tiergartenstr. 15-17, 69121 Heidelberg 80 pp. Englisch. Seller Inventory # 9783658291488
Quantity: 2 available
Stock Image
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization (BestMasters)
Seller: dsmbooks, Liverpool, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: New. New. book. Seller Inventory # D8F0-0-M-3658291486-6
Quantity: 1 available