Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP) (Q2892348): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: DBLP publication ID (P1635): journals/informs/CookEG07, #quickstatements; #temporary_batch_1731543907597
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: William Cook / rank
Normal rank
 
Property / author
 
Property / author: Daniel G. Espinoza / rank
Normal rank
 
Property / author
 
Property / author: William Cook / rank
 
Normal rank
Property / author
 
Property / author: Daniel G. Espinoza / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / 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.1287/ijoc.1060.0204 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2135173139 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56067406 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/informs/CookEG07 / rank
 
Normal rank

Latest revision as of 01:50, 14 November 2024

scientific article
Language Label Description Also known as
English
Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP)
scientific article

    Statements

    Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP) (English)
    0 references
    0 references
    0 references
    0 references
    18 June 2012
    0 references
    combinatorial optimization
    0 references
    traveling salesman
    0 references
    \texttt{TSPLIB}
    0 references
    cutting-plane algorithm
    0 references

    Identifiers