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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2008.05.016 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2008.05.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086806812 / 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: 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
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2008.05.016 / rank
 
Normal rank

Latest revision as of 12:22, 10 December 2024

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

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references