A continuous variable representation of the traveling salesman problem (Q4168793): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling Salesman Problem: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathology of Traveling-Salesman Subtour-Elimination Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / 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: Technical Note—Vertex Generation and Cardinality Constrained Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Experience with an <i>M</i>-Salesman Traveling Salesman Algorithm / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01609019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006851947 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:44, 30 July 2024

scientific article; zbMATH DE number 3601430
Language Label Description Also known as
English
A continuous variable representation of the traveling salesman problem
scientific article; zbMATH DE number 3601430

    Statements