The multi-stripe travelling salesman problem (Q1698268): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New classes of efficiently solvable generalized traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A canonical decomposition theory for metrics on a finite set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge Hamiltonian path problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases / 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: Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspectives of Monge properties in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating facilities which interact: Some solvable cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic assignment problem. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on circular decomposable metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of circular decomposable metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four-point conditions for the TSP: the complete complexity classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sometimes Travelling is Easy: The Master Tour Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solvable case of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian powers in threshold and arborescent comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symmetric quadratic traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of Hamiltonian paths in interval graphs / 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: The Steiner tree problem in Kalmanson matrices and in circulant matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Seymour conjecture for large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: When difference in machine loads leads to efficient scheduling in open shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems and the Location of Economic Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two / rank
 
Normal rank
Property / cites work
 
Property / cites work: The three-dimensional matching problem in kalmanson matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme Hamiltonian lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Master Problems / rank
 
Normal rank

Latest revision as of 04:28, 15 July 2024

scientific article
Language Label Description Also known as
English
The multi-stripe travelling salesman problem
scientific article

    Statements

    The multi-stripe travelling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    15 February 2018
    0 references
    0 references
    combinatorial optimization
    0 references
    computational complexity
    0 references
    travelling salesman problem
    0 references
    quadratic assignment problem
    0 references
    tractable special case
    0 references
    kalmanson conditions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references