Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem (Q633484): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5431823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedded local search approaches for routing optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for symmetric<i>K</i>-peripatetic salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for symmetric 2-peripatetic salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Undirected <i>m</i>-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective evolutionary algorithm for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel iterative search methods for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Granular Tabu Search and Its Application to the Vehicle-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic approach to the overnight security service problem / rank
 
Normal rank

Latest revision as of 23:04, 3 July 2024

scientific article
Language Label Description Also known as
English
Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem
scientific article

    Statements

    Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 April 2011
    0 references
    metaheuristics
    0 references
    vehicle routing problem
    0 references
    peripatetic salesman problem
    0 references
    peripatetic vehicle routing problem
    0 references
    0 references
    0 references
    0 references

    Identifiers