Using dual relaxations in multiobjective mixed-integer convex quadratic programming

DOI10.1007/S10898-024-01440-XMaRDI QIDQ6983490zbMATH OpenFDO

Authors M. De Santis, Gabriele Eichfelder, Daniele Patria, Leo Warnow

Publication date 14 May 2025

Published in Journal of Global Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10898-024-01440-X

zbMATH Keywords

branch-and-bound algorithmconvex quadratic optimizationmixed integer quadratic programmingmulti-objective optimization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Quadratic programming (90C20) Convex programming (90C25) Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites work

• A decision space algorithm for multiobjective convex quadratic integer optimization
• A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
• A feasible active set method with reoptimization for convex quadratic mixed-integer programming
• A general branch-and-bound framework for continuous global multiobjective optimization
• A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
• A solver for multiobjective mixed-integer convex and nonconvex optimization
• Advancements in the computation of enclosures for multi-objective optimization problems
• An approximation algorithm for multi-objective optimization problems using a box-coverage
• An effective branch-and-bound algorithm for convex quadratic integer programming
• An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations
• Approximation methods in multiobjective programming
• Bi-objective design-for-control of water distribution networks with global bounds
• Bi-objective optimisation over a set of convex sub-problems
• Bounds and convex heuristics for bi-objective optimal experiment design in water networks
• Branch-and-bound and objective branching with three or more objectives
• Branch-and-bound for bi-objective integer programming
• Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
• Multi-objective branch and bound
• Multicriteria Optimization
• Numerical Optimization
• On the representation of the search region in multi-objective optimization
• Solving multiobjective mixed integer convex optimization problems

Cited in

(1)

• Quadratic convex reformulations for multiobjective binary quadratic programming

This page was built for publication: Using dual relaxations in multiobjective mixed-integer convex quadratic programming

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