On optimality of a polynomial algorithm for random linear multidimensional assignment problem (Q628662): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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.1007/s11590-010-0198-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019511671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—The Multidimensional Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected topics on assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4801573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for three-dimensional assignment problems with triangle inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Three-Index Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4311918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the multisensor data association problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic probabilistic behaviour of quadratic sum assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic asymptotic properties of some combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinational optimization problems for which almost every algorithm is asymptotically optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of the expected optimal value of the multidimensional assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538132 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:25, 3 July 2024

scientific article
Language Label Description Also known as
English
On optimality of a polynomial algorithm for random linear multidimensional assignment problem
scientific article

    Statements

    On optimality of a polynomial algorithm for random linear multidimensional assignment problem (English)
    0 references
    0 references
    14 March 2011
    0 references
    0 references
    greedy heuristic
    0 references
    approximability
    0 references
    convergence almost surely
    0 references
    0 references