Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks (Q3150129): 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.1002/net.10028 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.10028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011230269 / 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: Sales‐delivery man problems on treelike networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on the Complexity of a Simple Transportation Problem / 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: 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: The delivery man problem on a tree network / 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: On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey Paper—Time Window Constrained Routing and Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special cases of traveling salesman and repairman problems with time windows / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/NET.10028 / rank
 
Normal rank

Latest revision as of 19:16, 20 December 2024

scientific article
Language Label Description Also known as
English
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
scientific article

    Statements

    Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 September 2002
    0 references
    routing and scheduling,
    0 references
    approximate algorithms,
    0 references
    performance guarantee,
    0 references
    worst-case analysis
    0 references

    Identifiers