Semi-preemptive routing on a linear and circular track (Q834179): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disopt.2009.01.001 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2009.01.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081582672 / 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: Routing a vehicle of capacity greater than one / 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: Semi-preemptive routing on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for a family of matroid intersection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISOPT.2009.01.001 / rank
 
Normal rank

Latest revision as of 04:40, 10 December 2024

scientific article
Language Label Description Also known as
English
Semi-preemptive routing on a linear and circular track
scientific article

    Statements

    Identifiers