Go to main content
login
Menu
Search
Author Profiles
Browse Author Profiles
Submit
Library Home
Contact Us
login
A branch-and-bound algorithm for multiobjective mixed-integer convex optimization / Stefan Rocktäschel.
Rocktäschel, Stefan.
2020
QA402.5
Available Online
Formats
Format
BibTeX
View
Download
MARCXML
View
Download
TextMARC
View
Download
MARC
View
Download
DublinCore
View
Download
EndNote
View
Download
NLM
View
Download
RefWorks
View
Download
RIS
View
Download
Add to Basket
Linked e-resources
Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
A branch-and-bound algorithm for multiobjective mixed-integer convex optimization / Stefan Rocktäschel.
Author
Rocktäschel, Stefan.
ISBN
9783658291495 (electronic book)
3658291494 (electronic book)
9783658291488
Publication Details
Wiesbaden : Springer Spektrum, 2020.
Language
English
Description
1 online resource (72 pages).
Call Number
QA402.5
Dewey Decimal Classification
519.6
Bibliography, etc. Note
Includes bibliographical references.
Access Note
Access limited to authorized users.
Source of Description
Description based on print version record.
Series
BestMasters.
Available in Other Form
A Branch-And-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Linked Resources
Online Access
Record Appears in
Online Resources
>
Ebooks
All Resources
Browse Subjects
Mathematical optimization.
Show more subjects...
Statistics
Views
Unique Views
from
to
By Days
By Months
By Years
Update
Export