A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization (1st ed. 2020) (BestMasters)
By:
Sign Up Now!
Already a Member? Log In
You must be logged into UK education collection to access this title.
Learn about membership options,
or view our freely available titles.
- 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.
- Copyright:
- 2020
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9783658291495
- Related ISBNs:
- 9783658291488
- Publisher:
- Springer Fachmedien Wiesbaden
- Date of Addition:
- 02/07/20
- Copyrighted By:
- N/A
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Mathematics and Statistics
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.