The maximum travelling salesman problem on symmetric Demidenko matrices (Q1962061): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Maximizing traveling salesman problem for special matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edgeconvex Circuits and the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme Hamiltonian Circuits. Resolution of the Convex-Odd Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme Hamiltonian Circuits. Resolution of the Convex-Even Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme Hamiltonian lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian properties of Toeplitz graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems / rank
 
Normal rank

Latest revision as of 12:29, 29 May 2024

scientific article
Language Label Description Also known as
English
The maximum travelling salesman problem on symmetric Demidenko matrices
scientific article

    Statements

    The maximum travelling salesman problem on symmetric Demidenko matrices (English)
    0 references
    20 March 2000
    0 references
    0 references
    travelling salesman problem
    0 references
    Demidenko condition
    0 references
    Kalmanson condition
    0 references
    Supnick condition
    0 references
    combinatorial optimization
    0 references
    computational complexity
    0 references
    polynomial algorithm
    0 references