Two phase algorithms for the bi-objective assignment problem (Q2455615): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.ejor.2006.12.054 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964735783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria Transportation Problem / 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: Q4670576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all minimum-cost perfect matchings in Bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4424281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper efficiency and the theory of vector maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria network flow problems: Integer case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-criteria assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for mixed zero-one multiple objective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource-Constrained Assignment Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The problem of the optimal biobjective spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the biobjective integer minimum cost flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of the MOSA method for the bicriteria assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem / rank
 
Normal rank

Latest revision as of 11:55, 27 June 2024

scientific article
Language Label Description Also known as
English
Two phase algorithms for the bi-objective assignment problem
scientific article

    Statements

    Two phase algorithms for the bi-objective assignment problem (English)
    0 references
    0 references
    0 references
    0 references
    25 October 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    Multi-objective optimisation
    0 references
    integer programming
    0 references
    assignment problem
    0 references
    two phase method
    0 references
    heuristic
    0 references
    path relinking
    0 references
    efficient solution
    0 references
    ranking algorithm
    0 references
    combinatorial optimization
    0 references
    metaheuristics
    0 references
    0 references