Special issue on exact and approximation methods for mixed-integer multi-objective optimization
From MaRDI portal
Cites work
- A fast and robust algorithm for solving biobjective mixed integer programs
- A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
- A simple, efficient and versatile objective space algorithm for multiobjective integer programming
- A test instance generator for multiobjective mixed-integer optimization
- An approximation algorithm for multiobjective mixed-integer convex optimization
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
- Approximating multiobjective optimization problems: how exact can you be?
- Augmenting bi-objective branch and bound by scalarization-based information
- Column generation based solution for bi-objective gate assignment problems
- Combining discrete and continuous information for multi-criteria optimization problems
- Complexity of the multiobjective minimum weight minimum stretch spanner problem
- On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem
- Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory
This page was built for publication: Special issue on exact and approximation methods for mixed-integer multi-objective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616268)
