Four-point conditions for the TSP: the complete complexity classification (Q2339841): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Vladimir G. Deǐneko / rank
Normal rank
 
Property / author
 
Property / author: Gerhard J. Woeginger / rank
Normal rank
 
Property / author
 
Property / author: Vladimir G. Deǐneko / rank
 
Normal rank
Property / author
 
Property / author: Gerhard J. Woeginger / 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.1016/j.disopt.2014.09.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985142991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Q3768703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme Hamiltonian lines / 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: Perspectives of Monge properties in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monge properties, discrete convexity and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another well-solvable case of the QAP: maximizing the job completion time variance / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Monge matrices arising from scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooperative assignment games with the inverse Monge property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing profits and costs on trees / 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: The Steiner tree problem in Kalmanson matrices and in circulant matrices / 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: A solvable case of the quadratic assignment problem / 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: Q4143015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended neighborhood: Definition and characterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of very large-scale neighborhood search techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: New exponential neighbourhood for polynomially solvable TSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four point conditions and exponential neighborhoods for symmetric TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Sided Monge TSP Is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum travelling salesman problem on symmetric Demidenko matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum traveling salesman problem on van der Veen matrices / 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: On the symmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5753758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solvable case of the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line sorting of twisted sequences in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the recognition of permuted Supnick and incomplete Monge matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank

Latest revision as of 23:16, 9 July 2024

scientific article
Language Label Description Also known as
English
Four-point conditions for the TSP: the complete complexity classification
scientific article

    Statements

    Four-point conditions for the TSP: the complete complexity classification (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 April 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    traveling salesman problem
    0 references
    four-point condition
    0 references
    polynomially solvable case
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references