Variable neighborhood search for the travelling deliveryman problem (Q1942008): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The time dependent traveling salesman problem: polyhedra and algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local and variable neighborhood search for the \(k\) -cardinality subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the heaviest \(k\)-subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum-of-squares clustering on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Delivery Man Problem and Cumulative Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighbourhood search: Methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighbourhood search: methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dijkstra's interpretation of the approach to solving a problem of program correctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new formulation for the traveling deliveryman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient GVNS for solving Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the minimum latency problem / rank
 
Normal rank

Latest revision as of 07:08, 6 July 2024

scientific article
Language Label Description Also known as
English
Variable neighborhood search for the travelling deliveryman problem
scientific article

    Statements

    Variable neighborhood search for the travelling deliveryman problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 March 2013
    0 references
    combinatorial optimization
    0 references
    routing
    0 references
    travelling deliveryman problem
    0 references
    metaheuristics
    0 references
    variable neighborhood search
    0 references

    Identifiers