An efficient procedure for finding best compromise solutions to the multi-objective assignment problem
From MaRDI portal
Publication:342019
DOI10.1016/j.cor.2014.03.016zbMath1349.90555OpenAlexW2090979038MaRDI QIDQ342019
Lucie Galand, Lyes Belhoul, 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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Discrete location and assignment (90B80)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Erratum to ``An algorithm for ranking assignments using reoptimization [Computers \& Operations Research 35 (2008) 3714-3726]
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Algorithms for finding k-best perfect matchings
- On spanning tree problems with multiple objectives
- Robust discrete optimization and its applications
- A note on a new variant of Murty's ranking assignments algorithm
- On scalarizing functions in multiobjective optimization
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
- A note on \(K\) best network flows
- An improved algorithm for solving biobjective integer programs
- A discussion of scalarization techniques for multiple objective integer programming
- Two phase algorithms for the bi-objective assignment problem
- An algorithm for ranking assignments using reoptimization
- Choquet-based optimisation in multiobjective shortest path and spanning tree problems
- The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results
- Assignment Problems
- The determination of the path with minimum-cost norm value
- Multicriteria Optimization
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
This page was built for publication: An efficient procedure for finding best compromise solutions to the multi-objective assignment problem
