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

DOI10.1007/978-3-658-29149-5MaRDI QIDQ5222091zbMATH OpenOpenAlexFDO

Authors 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) Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)

Recommendations

• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
• A branch and bound algorithm for mixed zero-one multiple objective linear programming
• Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
• A branch and bound method for the solution of multiparametric mixed integer linear programming problems
• A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
• A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
• Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
• Multi-objective branch and bound
• Solving multiobjective mixed integer convex optimization problems
• An improved branch and bound algorithm for mixed integer nonlinear programs

Cited in

(12)

• Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
• A decision space algorithm for multiobjective convex quadratic integer optimization
• A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
• A new bounding technique in branch-and-bound algorithms for mixed integer programming
• Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
• scientific article; zbMATH DE number 3889299 (Why is no real title available?)
• Solving multiobjective mixed integer convex optimization problems
• A solver for multiobjective mixed-integer convex and nonconvex optimization
• An improved branch and bound algorithm for mixed integer nonlinear programs
• Branch-and-bound and objective branching with three or more objectives
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
• A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222091)