A note on a new variant of Murty's ranking assignments algorithm
From MaRDI portal
Publication:1416101
DOI10.1007/s10288-003-0021-7zbMath1102.90052OpenAlexW2583771118MaRDI QIDQ1416101
Maria Eugénia Captivo, Marta M. B. Pascoal, Joao Carlos Namorado Climaco
Publication date: 2003
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-003-0021-7
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM ⋮ An efficient procedure for finding best compromise solutions to the multi-objective assignment problem ⋮ On discrete optimization with ordering ⋮ A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives ⋮ Minimizing value-at-risk in single-machine scheduling ⋮ Ordered weighted average optimization in multiobjective spanning tree problem ⋮ An algorithm for ranking assignments using reoptimization
This page was built for publication: A note on a new variant of Murty's ranking assignments algorithm
