A travelling salesman problem (TSP) with multiple job facilities. (Q2467832): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5646673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Solving Traveling-Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relation Between the Traveling-Salesman and the Longest-Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Travelling purchaser problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian Circuits / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf03398645 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2773469893 / rank
 
Normal rank

Latest revision as of 09:00, 30 July 2024

scientific article
Language Label Description Also known as
English
A travelling salesman problem (TSP) with multiple job facilities.
scientific article

    Statements

    Identifiers