An efficient procedure for finding best compromise solutions to the multi-objective assignment problem

DOI10.1016/J.COR.2014.03.016MaRDI QIDQ342019zbMATH OpenOpenAlexFDO

Authors Lyes Belhoul, Lucie Galand, Daniel Vanderpooten

Publication date 17 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2014.03.016

zbMATH Keywords

branch and bound\(k\)-best algorithmcompromise solutionsmulti-objective assignment problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 722224
• On the efficieny of feasible solutions of a multicriteria assignment problem
• Problema de asignacion cuadratica multiobjetivo
• The compromise hypersphere for multiobjective linear programming
• A Special Multi-Objective Assignment Problem

Cites work

• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 3679573 (Why is no real title available?)
• scientific article; zbMATH DE number 1149802 (Why is no real title available?)
• A discussion of scalarization techniques for multiple objective integer programming
• A note on \(K\) best network flows
• A note on a new variant of Murty's ranking assignments algorithm
• A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
• Algorithms for finding k-best perfect matchings
• An algorithm for ranking assignments using reoptimization
• An improved algorithm for solving biobjective integer programs
• Assignment Problems
• Choquet-based optimisation in multiobjective shortest path and spanning tree problems
• Erratum to ``An algorithm for ranking assignments using reoptimization [Computers \& Operations Research 35 (2008) 3714-3726]
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
• Multicriteria Optimization
• On scalarizing functions in multiobjective optimization
• On spanning tree problems with multiple objectives
• On the completeness and constructiveness of parametric characterizations to vector optimization problems
• Robust discrete optimization and its applications
• Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
• The bicriterion multimodal assignment problem: introduction, analysis, and experimental results
• The determination of the path with minimum-cost norm value
• Two phase algorithms for the bi-objective assignment problem

Cited in

(4)

• scientific article; zbMATH DE number 6303703 (Why is no real title available?)
• A Davidson college multi-objective assignment problem: a case study
• scientific article; zbMATH DE number 522743 (Why is no real title available?)
• Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem

This page was built for publication: An efficient procedure for finding best compromise solutions to the multi-objective assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342019)