Order Total (1 Item Items):
Shipping Destination:
Branch and Bound Algorithm Multiobjective Mixed Integer by Rocktäschel Stefan (9 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (9)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (9)
- As New, Fine or Near Fine (No further results match this refinement)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (No further results match this refinement)
- Softcover (9)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (5)
- Not Print on Demand (3)
Language (1)
Price
- Any Price
- Under US$ 25 (No further results match this refinement)
- US$ 25 to US$ 50 (No further results match this refinement)
- Over US$ 50
Free Shipping
- Free Shipping to U.S.A. (No further results match this refinement)
Seller Location
Seller Rating
-
-
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Book 87 of 91: BestMastersLanguage: English
Published by Springer Fachmedien Wiesbaden, 2020
ISBN 10: 3658291486 ISBN 13: 9783658291488
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.
-
Taschenbuch. Condition: Neu. A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization | Stefan Rocktäschel | Taschenbuch | BestMasters | viii | Englisch | 2020 | Springer VS | EAN 9783658291488 | Verantwortliche Person für die EU: Springer Spektrum in Springer Science + Business Media, Tiergartenstr. 15-17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
Condition: new. Questo è un articolo print on demand.
-
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Book 87 of 91: BestMastersLanguage: English
Published by Springer Fachmedien Wiesbaden Jan 2020, 2020
ISBN 10: 3658291486 ISBN 13: 9783658291488
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.
-
Condition: New. Print on Demand pp. 78.
-
Condition: New. PRINT ON DEMAND pp. 78.
-
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Book 87 of 91: BestMastersLanguage: English
Published by Springer Fachmedien Wiesbaden, 2020
ISBN 10: 3658291486 ISBN 13: 9783658291488
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.
-
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Book 87 of 91: BestMastersLanguage: English
Published by Springer VS Jan 2020, 2020
ISBN 10: 3658291486 ISBN 13: 9783658291488
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. 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-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 80 pp. Englisch.
