Computing the variance of tour costs over the solution space of the TSP in polynomial time (Q1935572): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1007/s10589-012-9472-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979680177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of elementary landscapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random tours in the traveling salesman problem: Analysis and application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5729634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search structure in the symmetric travelling salesperson problem under a general class of rearrangement neighborhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Random Symmetric Travelling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman. Computational solutions for RSP applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp deviation inequality for the stochastic traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mean field traveling salesman and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability theory of classical Euclidean optimization problems / rank
 
Normal rank

Latest revision as of 05:31, 6 July 2024

scientific article
Language Label Description Also known as
English
Computing the variance of tour costs over the solution space of the TSP in polynomial time
scientific article

    Statements

    Computing the variance of tour costs over the solution space of the TSP in polynomial time (English)
    0 references
    0 references
    0 references
    0 references
    18 February 2013
    0 references
    0 references
    traveling salesman problem
    0 references
    stochastic
    0 references
    moments
    0 references
    variance
    0 references
    statistics
    0 references
    probabilistic
    0 references
    landscapes
    0 references
    Hamiltonian cycle
    0 references
    0 references
    0 references
    0 references