On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices (Q623315): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/s10732-010-9127-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076697001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of parts and robot activities in a two machine robotic cell / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspectives of Monge properties in optimization / 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: Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Travelling Salesman Model for the Sequencing of Duties in Bus Crew Rotas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutational extreme values of autocorrelation coefficients and a Pitman test against serial dependence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5557602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine stochastic flow shops with blocking and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Flow-Shop Sequencing Problem with No Wait in Process<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4171863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932608 / rank
 
Normal rank

Latest revision as of 19:06, 3 July 2024

scientific article
Language Label Description Also known as
English
On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices
scientific article

    Statements

    On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices (English)
    0 references
    0 references
    0 references
    0 references
    14 February 2011
    0 references
    traveling salesman problem
    0 references
    subtour-patching heuristic
    0 references
    strongly NP-hard
    0 references
    asymptotically optimal
    0 references

    Identifiers