Coverart for item
The Resource A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization, by Stefan Rocktäschel, (electronic resource)

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization, by Stefan Rocktäschel, (electronic resource)

Label
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Title
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Statement of responsibility
by Stefan Rocktäschel
Creator
Subject
Language
eng
Summary
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. Contents Theoretical basics for solving multiobjective mixed-integer convex optimization problems An algorithm for solving this class of optimization problems Test instances and numerical results Target Groups Students and Lecturers in the field of mathematics and economics Practitioners in the field of multiobjective mixed-integer convex optimization problems The Author Stefan Rocktäschel works as scientific assistant at the Institute for Mathematics of Technische Universität Ilmenau, Germany.--
Member of
Assigning source
Provided by publisher
http://library.link/vocab/creatorName
Rocktäschel, Stefan
Image bit depth
0
Literary form
non fiction
Nature of contents
dictionaries
Series statement
  • BestMasters,
  • Springer eBooks.
http://library.link/vocab/subjectName
  • Applied mathematics
  • Engineering mathematics
  • Computer mathematics
Label
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization, by Stefan Rocktäschel, (electronic resource)
Link
https://eui.idm.oclc.org/login?url=https://doi.org/10.1007/978-3-658-29149-5
Instantiates
Publication
Antecedent source
mixed
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Theoretical basics for solving multiobjective mixed-integer convex optimization problems -- An algorithm for solving this class of optimization problems -- Test instances and numerical results
Control code
978-3-658-29149-5
Dimensions
unknown
Edition
1st ed. 2020.
Extent
1 online resource (VIII, 70 pages)
File format
multiple file formats
Form of item
  • online
  • electronic
Governing access note
Use of this electronic resource may be governed by a license agreement which restricts use to the European University Institute community. Each user is responsible for limiting use to individual, non-commercial purposes, without systematically downloading, distributing, or retaining substantial portions of information, provided that all copyright and other proprietary notices contained on the materials are retained. The use of software, including scripts, agents, or robots, is generally prohibited and may result in the loss of access to these resources for the entire European University Institute community
Isbn
9783658291495
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
15 illustrations
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(OCoLC)1138676659
Label
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization, by Stefan Rocktäschel, (electronic resource)
Link
https://eui.idm.oclc.org/login?url=https://doi.org/10.1007/978-3-658-29149-5
Publication
Antecedent source
mixed
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Theoretical basics for solving multiobjective mixed-integer convex optimization problems -- An algorithm for solving this class of optimization problems -- Test instances and numerical results
Control code
978-3-658-29149-5
Dimensions
unknown
Edition
1st ed. 2020.
Extent
1 online resource (VIII, 70 pages)
File format
multiple file formats
Form of item
  • online
  • electronic
Governing access note
Use of this electronic resource may be governed by a license agreement which restricts use to the European University Institute community. Each user is responsible for limiting use to individual, non-commercial purposes, without systematically downloading, distributing, or retaining substantial portions of information, provided that all copyright and other proprietary notices contained on the materials are retained. The use of software, including scripts, agents, or robots, is generally prohibited and may result in the loss of access to these resources for the entire European University Institute community
Isbn
9783658291495
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
15 illustrations
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(OCoLC)1138676659

Library Locations

    • Badia FiesolanaBorrow it
      Via dei Roccettini 9, San Domenico di Fiesole, 50014, IT
      43.803074 11.283055
Processing Feedback ...