The traveling-salesman problem and minimum spanning trees: Part II (Q5641007): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q96162761, #quickstatements; #temporary_batch_1705872010755
Created claim: DBLP publication ID (P1635): journals/mp/HeldK71, #quickstatements; #temporary_batch_1731475607626
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Richard M. Karp / rank
Normal rank
 
Property / author
 
Property / author: Richard M. Karp / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling Salesman Problem: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal assignments in an ordered set: An application of matroid theory / 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 Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/mp/HeldK71 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:29, 13 November 2024

scientific article; zbMATH DE number 3368467
Language Label Description Also known as
English
The traveling-salesman problem and minimum spanning trees: Part II
scientific article; zbMATH DE number 3368467

    Statements

    Identifiers