An approximation algorithm for multiobjective mixed-integer convex optimization
From MaRDI portal
Recommendations
- A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
- An algorithm for approximating nondominated points of convex multiobjective optimization problems
- An approximation algorithm for convex multi-objective programming problems
- Solving multiobjective mixed integer convex optimization problems
- An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems
Cites work
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- A new scalarization technique and new algorithms to generate Pareto fronts
- Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
- An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems
- An approximation algorithm for convex multi-objective programming problems
- Approximation methods in multiobjective programming
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- Enhancement of sandwich algorithms for approximating higher-dimensional convex Pareto sets
- Finding a representative nondominated set for multi-objective mixed integer programs
- Generalized homotopy approach to multiobjective optimization.
- Interactive \textsc{Nonconvex Pareto Navigator} for multiobjective optimization
- Multicriteria Optimization
- Pareto navigator for interactive nonlinear multiobjective optimization
- Primal and dual approximation algorithms for convex vector optimization problems
- Solving multiobjective mixed integer convex optimization problems
- The quickhull algorithm for convex hulls
- Tractability of convex vector optimization problems in the sense of polyhedral approximations
- Unbiased approximation in multicriteria optimization
Cited in
(4)- Special issue on exact and approximation methods for mixed-integer multi-objective 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
- Efficient approximation quality computation for sandwiching algorithms for convex multicriteria optimization
This page was built for publication: An approximation 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 Q6616281)
