Traveling salesman problem with clustering (Q616229): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10955-010-0080-z / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Concorde / 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/s10955-010-0080-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050731992 / 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: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / 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: A Study of Domino-Parity and k-Parity Constraints for the TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The time-dependent traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for Backbones—a high-performance parallel algorithm for solving combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Record breaking optimization results using the ruin and recreate principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMIZATION OF PRODUCTION PLANNING PROBLEMS — A CASE STUDY FOR ASSEMBLY LINES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching, Euler tours and the Chinese postman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed performance heuristics for the bottleneck traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moments of random walk with fixed end point / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of the clustered travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The landscape of the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the neighborhood structure of the traveling salesman problem generated by local search moves / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10955-010-0080-Z / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:40, 9 December 2024

scientific article
Language Label Description Also known as
English
Traveling salesman problem with clustering
scientific article

    Statements

    Traveling salesman problem with clustering (English)
    0 references
    0 references
    0 references
    0 references
    7 January 2011
    0 references
    simulated annealing
    0 references

    Identifiers