A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
by Stefan Rocktäschel 2020-05-06 09:56:56
image1
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 a... Read more
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. Less
  • Publication date
  • Language
  • ISBN
  • January 21, 2020
  • eng
  • 9783658291495
Compare Prices
Available Discount
12 % OFF
12% off Academic Book Titles (ebooks.com)

See More Details

Description: Back to School Promotion at eBooks.com. 12% off Academic book titles. Landing page is on our academics category page. Static image.

10 % OFF
Save 10% OFF on Student Text Books (ebooks.com)

See More Details

Description: Purchase textbooks at student discounts!

20 % OFF
20% Off on selected Categories

See More Details

Description: 20% Off these Categories- Body Mind & Spirit, Family & Relationships, Foreign Language Study, History, Sports & Recreation. Offer Lasts all through January.

Related Books