An exact algorithm with linear complexity for a problem of visiting megalopolises (Q2396369): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: To question of routing of works complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming in the routing problem with constraints and costs depending on a list of tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problem of successive megalopolis traversal with the precedence conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of the problem about a minimum-weight cycle cover of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Treatment of the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New classes of efficiently solvable generalized traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem. II: Exact methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of dynamic programming for sequencing problems with precedence constraints / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s0081543816090054 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2582089955 / rank
 
Normal rank

Latest revision as of 08:45, 30 July 2024

scientific article
Language Label Description Also known as
English
An exact algorithm with linear complexity for a problem of visiting megalopolises
scientific article

    Statements

    An exact algorithm with linear complexity for a problem of visiting megalopolises (English)
    0 references
    0 references
    8 June 2017
    0 references
    traveling salesman problem
    0 references
    NP-hard problem
    0 references
    dynamic programming
    0 references
    precedence relations
    0 references

    Identifiers