01473nam 2200433 450 991014949250332120230807212020.03-8317-4131-X(CKB)3710000000820607(EBL)4572061(OCoLC)956620946(MiAaPQ)EBC4572061(EXLCZ)99371000000082060720160916h20152015 uy 0engur|n|---|||||rdacontentrdamediardacarrierCity trip Manchester /Anna Regeniter1. Auflage.Bielefeld, [Germany] :Reise Know-How Verlag Peter Rump,2015.©20151 online resource (149 p.)Reise Know-HowIncludes index.3-8317-2523-3 Front Cover; Body; Table of Contents; Auf ins Vergnuegen; Am Puls der Stadt; Manchester entdecken; Praktische Reisetipps; Anhang; Kleine Sprachhilfe; Index; Copyright; Liste der Karteneintraege; Zeichenerklaerung/ Manchester mit PC, Smartphone & Co./ Apps zu Manchester; Front Flap; Back Flap; FaltplanReise Know-How.Manchester (England)Description and travel307.12160942733Regeniter Anna1371125MiAaPQMiAaPQMiAaPQBOOK9910149492503321City trip Manchester3414887UNINA02819nam 22005175 450 991048500020332120251113211218.03-658-29149-410.1007/978-3-658-29149-5(CKB)4100000010119207(DE-He213)978-3-658-29149-5(MiAaPQ)EBC6027148(PPN)242844065(EXLCZ)99410000001011920720200121d2020 u| 0engurnn|008mamaatxtrdacontentcrdamediacrrdacarrierA Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization /by Stefan Rocktäschel1st ed. 2020.Wiesbaden :Springer Fachmedien Wiesbaden :Imprint: Springer Spektrum,2020.1 online resource (VIII, 70 p. 15 illus.) BestMasters,2625-36153-658-29148-6 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 forMathematics of Technische Universität Ilmenau, Germany.BestMasters,2625-3615MathematicsMathematicsData processingApplications of MathematicsComputational Mathematics and Numerical AnalysisMathematics.MathematicsData processing.Applications of Mathematics.Computational Mathematics and Numerical Analysis.519.3Rocktäschel Stefanauthttp://id.loc.gov/vocabulary/relators/aut963845MiAaPQMiAaPQMiAaPQBOOK9910485000203321Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization2983597UNINA