Semi-preemptive routing on trees (Q1003476): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Exact arborescences, matchings and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Ensemble Motion Planning on a Tree / 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: Routing a vehicle of capacity greater than one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euler is standing in line dial-a-ride problems with precedence-constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi–preemptive routing on a line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-preemptive routing on a linear and circular track / rank
 
Normal rank

Latest revision as of 03:31, 29 June 2024

scientific article
Language Label Description Also known as
English
Semi-preemptive routing on trees
scientific article

    Statements

    Semi-preemptive routing on trees (English)
    0 references
    0 references
    0 references
    0 references
    4 March 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    pickup and delivery
    0 references
    dial-a-ride
    0 references
    transportation
    0 references
    approximation
    0 references
    colored arborescences
    0 references
    Stacker crane
    0 references
    0 references