Multi-objective meta-heuristics for the traveling salesman problem with profits (Q928691): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Concorde / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LKH / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / 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/s10852-008-9080-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982052569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey and annotated bibliography of multiobjective combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for the undirected selective travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for nonlinear and parametric optimization (with links to genetic algorithms) / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: The selective travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed tours and path ejections for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank

Latest revision as of 11:45, 28 June 2024

scientific article
Language Label Description Also known as
English
Multi-objective meta-heuristics for the traveling salesman problem with profits
scientific article

    Statements

    Multi-objective meta-heuristics for the traveling salesman problem with profits (English)
    0 references
    0 references
    0 references
    0 references
    11 June 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Routing problem
    0 references
    Multi-objective optimization
    0 references
    Ejection chain
    0 references
    Evolutionary algorithm
    0 references
    Hybrid method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references