You are here
Back to topA Branch-And-Bound Algorithm for Multiobjective Mixed-Integer Convex Optimization (Bestmasters) (Paperback)
Email or call for price
Description
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.