A simple LP relaxation for the asymmetric traveling salesman problem (Q378136): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-012-0544-9 / rank
Normal rank
 
Property / author
 
Property / author: H. S. Yoon / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6225220 / rank
 
Normal rank
Property / zbMATH Keywords
 
subtour elimination linear program relaxation
Property / zbMATH Keywords: subtour elimination linear program relaxation / rank
 
Normal rank
Property / zbMATH Keywords
 
extreme solutions
Property / zbMATH Keywords: extreme solutions / rank
 
Normal rank
Property / zbMATH Keywords
 
traveling salesman problem
Property / zbMATH Keywords: traveling salesman problem / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-012-0544-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010462135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Integrality Ratio for the Asymmetric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4371290 / 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: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A factor 2 approximation algorithm for the generalized Steiner network problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivable Network Design with Degree or Order Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252438 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-012-0544-9 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:45, 9 December 2024

scientific article
Language Label Description Also known as
English
A simple LP relaxation for the asymmetric traveling salesman problem
scientific article

    Statements

    Identifiers