Results for the close-enough traveling salesman problem with a branch-and-bound algorithm (Q6097759): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel discretization scheme for the close enough traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3447238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic best first search: Using contours to guide branch‐and‐bound algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:16, 1 August 2024

scientific article; zbMATH DE number 7693258
Language Label Description Also known as
English
Results for the close-enough traveling salesman problem with a branch-and-bound algorithm
scientific article; zbMATH DE number 7693258

    Statements

    Results for the close-enough traveling salesman problem with a branch-and-bound algorithm (English)
    0 references
    0 references
    0 references
    0 references
    7 June 2023
    0 references
    0 references
    close-enough traveling salesman problem
    0 references
    branch-and-bound algorithm
    0 references
    combinatorial optimization
    0 references
    computation
    0 references
    0 references
    0 references