An efficient genetic algorithm for the traveling salesman problem with precedence constraints (Q1848588): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q336767
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Jong Soo Kim / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Additive Bounding Procedure for Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3475129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of travelling salesman problem formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster based branching for the asymmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using cutting planes to solve the symmetric Travelling Salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the pickup and delivery traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The General Pickup and Delivery Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023852 / rank
 
Normal rank

Latest revision as of 18:24, 4 June 2024

scientific article
Language Label Description Also known as
English
An efficient genetic algorithm for the traveling salesman problem with precedence constraints
scientific article

    Statements

    An efficient genetic algorithm for the traveling salesman problem with precedence constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 November 2002
    0 references
    0 references
    traveling salesman problem with precedence constraints
    0 references
    genetic algorithm
    0 references
    topological sort
    0 references
    optimization
    0 references