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

DOI10.1007/978-3-658-29149-5zbMath1446.90125OpenAlexW3000825985MaRDI QIDQ5222091

Stefan Rocktäschel

Publication date: 30 March 2020

Published in: BestMasters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-658-29149-5

zbMATH Keywords

cover of the efficient set

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29)

Related Items (1)

Solving Multiobjective Mixed Integer Convex Optimization Problems

This page was built for publication: A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization