Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
From MaRDI portal
Publication:4995057
DOI10.1287/ijoc.2020.0953OpenAlexW3033062339MaRDI QIDQ4995057
Satya Tamby, Daniel Vanderpooten
Publication date: 23 June 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2020.0953
Related Items
On the exactness of the \(\varepsilon\)-constraint method for biobjective nonlinear integer programming ⋮ Finding non dominated points for multiobjective integer convex programs with linear constraints ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Network Models for Multiobjective Discrete Optimization ⋮ A decision space algorithm for multiobjective convex quadratic integer optimization ⋮ Split algorithms for multiobjective integer programming problems ⋮ Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs ⋮ Branch-and-bound and objective branching with three or more objectives ⋮ A matheuristic for tri-objective binary integer linear programming ⋮ Exact and approximate determination of the Pareto front using minimal correction subsets
Cites Work
- Unnamed Item
- The \(L\)-shape search method for triobjective integer programming
- On the representation of the search region in multi-objective optimization
- Finding all nondominated points of multi-objective integer programs
- On a multicriteria shortest path problem
- Solving efficiently the 0-1 multi-objective knapsack problem
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- An algorithm for the multiple objective integer linear programming problem
- Efficient computation of the search region in multi-objective optimization
- Multi-objective branch and bound
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- Multi-objective integer programming: an improved recursive algorithm
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
- Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
- Benchmarking optimization software with performance profiles.
