Solving a Routing Problem with the Aid of an Independent Computations Scheme (Q4692135): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2801282736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: In Pursuit of the Traveling Salesman / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem. I: Theoretical issues / 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: The traveling salesman problem. Approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Traveling Salesman Problem / 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: Q3074625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid optimization methods for time-dependent sequencing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing under constraints: problem of visit to megalopolises / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3281164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / 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: Route problem with constraints depending on a list of tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2794992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of dynamic programming for sequencing problems with precedence constraints / rank
 
Normal rank

Latest revision as of 03:17, 17 July 2024

scientific article; zbMATH DE number 6966283
Language Label Description Also known as
English
Solving a Routing Problem with the Aid of an Independent Computations Scheme
scientific article; zbMATH DE number 6966283

    Statements

    Solving a Routing Problem with the Aid of an Independent Computations Scheme (English)
    0 references
    0 references
    26 October 2018
    0 references
    0 references
    dynamic programming
    0 references
    route
    0 references
    sequencing
    0 references
    precedence constraints
    0 references
    parallel computation
    0 references
    0 references