An efficient procedure for finding best compromise solutions to the multi-objective assignment problem (Q342019): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2014.03.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090979038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for finding k-best perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discussion of scalarization techniques for multiple objective integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choquet-based optimisation in multiobjective shortest path and spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4387184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on \(K\) best network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On spanning tree problems with multiple objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On scalarizing functions in multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: The determination of the path with minimum-cost norm value / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a new variant of Murty's ranking assignments algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for ranking assignments using reoptimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum to ``An algorithm for ranking assignments using reoptimization'' [Computers \& Operations Research 35 (2008) 3714-3726] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two phase algorithms for the bi-objective assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for solving biobjective integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3875728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness and constructiveness of parametric characterizations to vector optimization problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:55, 12 July 2024

scientific article
Language Label Description Also known as
English
An efficient procedure for finding best compromise solutions to the multi-objective assignment problem
scientific article

    Statements

    An efficient procedure for finding best compromise solutions to the multi-objective assignment problem (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    multi-objective assignment problem
    0 references
    compromise solutions
    0 references
    branch and bound
    0 references
    \(k\)-best algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references