An algorithm for ranking assignments using reoptimization (Q2483518): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2007.04.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018962602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some techniques useful for solution of transportation network problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A shortest augmenting path algorithm for dense and sparse linear assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and codes for dense assignment problems: The state of the art / 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: A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path 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: A note on a new variant of Murty's ranking assignments algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming on Cray Supercomputers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm / rank
 
Normal rank

Latest revision as of 22:26, 27 June 2024

scientific article
Language Label Description Also known as
English
An algorithm for ranking assignments using reoptimization
scientific article

    Statements

    An algorithm for ranking assignments using reoptimization (English)
    0 references
    0 references
    0 references
    28 April 2008
    0 references
    0 references
    linear assignment problem
    0 references
    ranking
    0 references
    \(K\) best solutions
    0 references
    0 references