TSP race: minimizing completion time in time-sensitive applications (Q319282): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q556706
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Joel S. Sokol / 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.1016/j.ejor.2014.12.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076598850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chained Lin-Kernighan for Large Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the on-line quota traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the multiple depot vehicle scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Solving Traveling-Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of hard real-time scheduling for multiprocessor systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365133 / 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: Expanding neighborhood GRASP for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient scheduling strategies for processing multiple divisible loads on bus networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation / rank
 
Normal rank

Latest revision as of 16:38, 12 July 2024

scientific article
Language Label Description Also known as
English
TSP race: minimizing completion time in time-sensitive applications
scientific article

    Statements

    TSP race: minimizing completion time in time-sensitive applications (English)
    0 references
    0 references
    0 references
    6 October 2016
    0 references
    computation-implementation parallelization
    0 references
    heuristic
    0 references
    TSP race
    0 references

    Identifiers