The travelling salesman problem with pick-up and delivery (Q1342068): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(94)90360-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032686693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5729634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank

Latest revision as of 10:19, 23 May 2024

scientific article
Language Label Description Also known as
English
The travelling salesman problem with pick-up and delivery
scientific article

    Statements

    The travelling salesman problem with pick-up and delivery (English)
    0 references
    0 references
    11 January 1995
    0 references
    asymptotic behavior
    0 references
    travelling salesman
    0 references
    heuristic
    0 references
    worst case analysis
    0 references

    Identifiers