A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems

Cites Work

Unnamed Item
On the representation of the search region in multi-objective optimization
An exact algorithm for biobjective mixed integer linear programming problems
Optimal allocation of water to competing stakeholders in a shared watershed
Bound sets for biobjective combinatorial optimization problems
An algorithmic framework for convex mixed integer nonlinear programs
Equity portfolio construction and selection using multiobjective mathematical programming
Solving mixed integer nonlinear programs by outer approximation
Variational methods in partially ordered spaces
Scalarizing vector optimization problems
A general branch-and-bound framework for continuous global multiobjective optimization
Bi-objective optimisation over a set of convex sub-problems
An approximation algorithm for multi-objective optimization problems using a box-coverage
GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
Approximation methods in multiobjective programming
A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems
Solving Multiobjective Mixed Integer Convex Optimization Problems
A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
Multicriteria Optimization
Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
A test instance generator for multiobjective mixed-integer optimization