A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks (Q5326779): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Raffaele Cerulli / rank
 
Normal rank
Property / author
 
Property / author: Maria Grazia Speranza / 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.1002/net.21468 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2168881324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the double traveling salesman problem with multiple stacks / 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 branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics for the vehicle routing problem with loading constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pickup and delivery traveling salesman problem with first-in-first-out loading / rank
 
Normal rank
Property / cites work
 
Property / cites work: The double traveling salesman problem with multiple stacks: A variable neighborhood search approach / 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: An additive bounding procedure for the asymmetric travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colony optimization for the two-dimensional loading vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics for vehicle routing problems with three-dimensional loading constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method for the double TSP with multiple stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solutions to the double travelling salesman problem with multiple stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of the Multiple Stack TSP, kSTSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and exact algorithms for the multi-pile vehicle routing problem / rank
 
Normal rank

Latest revision as of 17:09, 6 July 2024

scientific article; zbMATH DE number 6195674
Language Label Description Also known as
English
A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
scientific article; zbMATH DE number 6195674

    Statements

    A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 August 2013
    0 references
    double traveling salesman problem
    0 references
    pickup and delivery problems
    0 references
    branch-and-bound
    0 references
    LIFO
    0 references
    multiple stacks
    0 references
    0 references

    Identifiers