Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem
From MaRDI portal
Publication:3649594
DOI10.1007/978-3-540-85646-7_8zbMath1176.90525OpenAlexW63335672MaRDI QIDQ3649594
Matthias Ehrgott, Gandibleux Xavier, Przybylski Anthony
Publication date: 4 December 2009
Published in: Multiobjective Programming and Goal Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85646-7_8
Related Items (6)
An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems ⋮ Ordinal optimization through multi-objective reformulation ⋮ A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives ⋮ A review of multiobjective programming and its application in quantitative psychology ⋮ Multi-objective integer programming: an improved recursive algorithm ⋮ A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
Cites Work
- Unnamed Item
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Bound sets for biobjective combinatorial optimization problems
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- Two phase algorithms for the bi-objective assignment problem
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
This page was built for publication: Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem
