A multiperiod traveling salesman problem: Heuristic algorithms (Q1195106): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Giuseppe Paletta / rank
Normal rank
 
Property / author
 
Property / author: Giuseppe Paletta / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal distribution strategies with cyclic demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic for the Periodic Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The period routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:35, 16 May 2024

scientific article
Language Label Description Also known as
English
A multiperiod traveling salesman problem: Heuristic algorithms
scientific article

    Statements

    A multiperiod traveling salesman problem: Heuristic algorithms (English)
    0 references
    5 October 1992
    0 references
    traveling salesman
    0 references
    heuristic algorithms
    0 references
    shortest path on a layered network
    0 references
    0 references

    Identifiers