Euler is standing in line dial-a-ride problems with precedence-constraints (Q5948963): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4494399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2728857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Postman tour on a graph with precedence relation on arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line single-server dial-a-ride problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonpreemptive Ensemble Motion Planning on a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing a vehicle of capacity greater than one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding optimum branchings / rank
 
Normal rank

Latest revision as of 21:21, 3 June 2024

scientific article; zbMATH DE number 1672488
Language Label Description Also known as
English
Euler is standing in line dial-a-ride problems with precedence-constraints
scientific article; zbMATH DE number 1672488

    Statements

    Euler is standing in line dial-a-ride problems with precedence-constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 November 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    vehicle routing
    0 references
    elevator system
    0 references
    Eulerian cycle
    0 references
    approximation algorithms
    0 references