A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
From MaRDI portal
Publication:2899069
DOI10.1287/ijoc.1090.0342zbMath1243.90203OpenAlexW2109785169MaRDI QIDQ2899069
Matthias Ehrgott, Xavier Gandibleux, Anthony Przybylski
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1090.0342
multiobjective integer programmingefficient solution: weight space decompositionnondominated extreme point
Integer programming (90C10) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Related Items (40)
SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems ⋮ Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems ⋮ Graphical exploration of the weight space in three-objective mixed integer linear programs ⋮ A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods ⋮ Choquet optimal set in biobjective combinatorial optimization ⋮ Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems ⋮ A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems ⋮ Computing representations using hypervolume scalarizations ⋮ On nadir points of multiobjective integer programming problems ⋮ Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems ⋮ Optimization of a linear function over an integer efficient set ⋮ Two‐phase strategies for the bi‐objective minimum spanning tree problem ⋮ Computing efficiently the nondominated subset of a set sum ⋮ Effective anytime algorithm for multiobjective combinatorial optimization problems ⋮ Ordinal optimization through multi-objective reformulation ⋮ The trade-off between costs and carbon emissions from economic lot-sizing decisions ⋮ Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions ⋮ Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ Optimization of a quadratic programming problem over an Integer efficient set ⋮ Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems ⋮ Weight set decomposition for weighted rank and rating aggregation: an interpretable and visual decision support tool ⋮ 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 ⋮ Optimising a nonlinear utility function in multi-objective integer programming ⋮ Disjunctive Programming for Multiobjective Discrete Optimisation ⋮ PolySCIP ⋮ On the effects of combining objectives in multi-objective optimization ⋮ Finding a representative nondominated set for multi-objective mixed integer programs ⋮ Multi-objective branch and bound ⋮ The search-and-remove algorithm for biobjective mixed-integer linear programming problems ⋮ Multi-objective integer programming: an improved recursive algorithm ⋮ A parametric simplex algorithm for linear vector optimization problems ⋮ Two-phase Pareto local search for the biobjective traveling salesman problem ⋮ An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems ⋮ Finding multi-objective supported efficient spanning trees ⋮ A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem ⋮ Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem ⋮ GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs ⋮ FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming ⋮ An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
This page was built for publication: A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
