Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems (Q1009187): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LKH / rank
 
Normal rank
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/s10732-007-9033-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012738417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / 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: Greedy-type resistance of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction heuristics for the asymmetric TSP. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination analysis of greedy heuristics for the frequency assignment problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251080 / 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: Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination analysis of some heuristics for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSP heuristics: domination analysis and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tracking elementary particles near their primary vertex: A combinatorial approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3284265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem / rank
 
Normal rank

Latest revision as of 09:04, 1 July 2024

scientific article
Language Label Description Also known as
English
Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
scientific article

    Statements

    Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems (English)
    0 references
    0 references
    0 references
    0 references
    31 March 2009
    0 references
    traveling salesman problem
    0 references
    multidimensional assignment problem
    0 references
    greedy heuristics
    0 references
    domination analysis
    0 references

    Identifiers