An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
From MaRDI portal
Publication:785628
DOI10.1007/s10898-020-00898-9zbMath1447.90057OpenAlexW3011677699MaRDI QIDQ785628
Tobias Dietz, Stefan Ruzika, Anthony Przybylski, Pascal Halffmann
Publication date: 7 August 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00898-9
Related Items (1)
Cites Work
- Unnamed Item
- Graphical exploration of the weight space in three-objective mixed integer linear programs
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Connectedness of efficient solutions in multiple objective combinatorial optimization
- Benson type algorithms for linear vector optimization and applications
- On generating all maximal independent sets
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- On the cardinality of the Pareto set in bicriteria shortest path problems
- Proper efficiency and the theory of vector maximization
- A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
- An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
- Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems
- Approximability and Hardness in Multi-objective Optimization
- Geometric Duality in Multiple Objective Linear Programming
- Bicriteria Transportation Problem
- Multicriteria Optimization
- Computational Complexity
This page was built for publication: An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
