Special issue on exact and approximation methods for mixed-integer multi-objective optimization

DOI10.1007/s00186-024-00874-zzbMATH Open1546.00074MaRDI QIDQ6616268

No author found.

Publication date: 9 October 2024

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)

Cites Work

• Approximating multiobjective optimization problems: how exact can you be?
• Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory
• Complexity of the multiobjective minimum weight minimum stretch spanner problem
• 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
• On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem
• A fast and robust algorithm for solving biobjective mixed integer programs
• An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
• A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
• An approximation algorithm for multiobjective mixed-integer convex optimization
• A simple, efficient and versatile objective space algorithm for multiobjective integer programming
• A test instance generator for multiobjective mixed-integer optimization

This page was built for publication: Special issue on exact and approximation methods for mixed-integer multi-objective optimization