A new heuristic for the period traveling salesman problem (Q1894732): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: XMP / 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/0305-0548(94)00031-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997853206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem: An overview of exact and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The period routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiperiod traveling salesman problem: Heuristic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing vehicle routing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New optimization heuristics. The great deluge algorithm and the record- to-record travel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank

Latest revision as of 14:54, 23 May 2024

scientific article
Language Label Description Also known as
English
A new heuristic for the period traveling salesman problem
scientific article

    Statements

    Identifiers