An approximability result of the multi-vehicle scheduling problem on a path with release and handling times (Q1884949): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.tcs.2003.09.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005650729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sales‐delivery man problems on treelike networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. / rank
 
Normal rank
Property / cites work
 
Property / cites work: VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle scheduling on a tree with release and handling times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4494938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Of The Single Vehicle Scheduling Problem On Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing and Scheduling on a Shoreline with Release Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special cases of traveling salesman and repairman problems with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-vehicle scheduling with time window constraints / rank
 
Normal rank

Latest revision as of 14:51, 7 June 2024

scientific article
Language Label Description Also known as
English
An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
scientific article

    Statements

    An approximability result of the multi-vehicle scheduling problem on a path with release and handling times (English)
    0 references
    0 references
    0 references
    27 October 2004
    0 references
    Discrete optimization
    0 references
    Vehicle scheduling
    0 references
    Polynomial time approximation scheme
    0 references
    Dynamic programming
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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