Get Free Shipping on orders over $79
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization - Stefan Rocktäschel

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization

By: Stefan Rocktäschel

eText | 21 January 2020

At a Glance

eText


$84.99

or 4 interest-free payments of $21.25 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
Stefan Rocktaschel 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.
on
Desktop
Tablet
Mobile

More in Applied Mathematics

An Introduction to Stochastic Modeling - Gabriel Lord

eBOOK

RRP $145.41

$130.99

10%
OFF
Markov Chains : Theory and Applications - C.R. Rao

eBOOK

RRP $359.04

$323.99

10%
OFF
Pi the Laws of Duality - G. Neal

eBOOK

Grape Explications - Neal D. Hulkower

eBOOK

RRP $18.69

$17.99

Mathematics for Engineers - Ritu Shrivastava

eBOOK

Discrete Mathematics - Julian Ting

eBOOK