Advancements in the computation of enclosures for multi-objective optimization problems

DOI10.1016/J.EJOR.2023.02.032MaRDI QIDQ6113330zbMATH OpenFDO

Authors Gabriele Eichfelder, Leo Warnow

Publication date 11 July 2023

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2023.02.032

zbMATH Keywords

enclosuremixed-integer programmingmultiple objective programmingnonlinear programmingwarm start strategies

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A Benson type algorithm for nonconvex multiobjective programming problems
• A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
• A deterministic algorithm for global multi-objective optimization
• A general branch-and-bound framework for continuous global multiobjective optimization
• Adaptive Scalarization Methods in Multiobjective Optimization
• Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
• An approximation algorithm for convex multi-objective programming problems
• An approximation algorithm for multi-objective optimization problems using a box-coverage
• An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs
• An objective space cut and bound algorithm for convex multiplicative programmes
• Approximation methods in multiobjective programming
• Bilevel programming for generating discrete representations in multiobjective optimization
• Bound sets for biobjective combinatorial optimization problems
• Computing representations using hypervolume scalarizations
• Discrete representation of non-dominated sets in multi-objective linear programming
• Efficient computation of expected hypervolume improvement using box decomposition algorithms
• Efficient computation of the search region in multi-objective optimization
• Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
• On the representation of the search region in multi-objective optimization
• Scalarizing vector optimization problems
• Solving multiobjective mixed integer convex optimization problems
• Twenty years of continuous multiobjective optimization in the twenty-first century
• Unbiased approximation in multicriteria optimization
• Variational methods in partially ordered spaces

Cited in

(8)

• Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects
• Multi-objective continuous review inventory policy using MOPSO and TOPSIS methods
• A test instance generator for multiobjective mixed-integer optimization
• Designing sustainable diet plans by solving triobjective integer programs
• Decision making strategy for - I equilibrium problem in network designing
• Using dual relaxations in multiobjective mixed-integer convex quadratic programming
• Quadratic convex reformulations for multiobjective binary quadratic programming
• Test instances for multiobjective mixed-integer nonlinear optimization

This page was built for publication: Advancements in the computation of enclosures for multi-objective optimization problems

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