An ILP improvement procedure for the open vehicle routing problem (Q991364): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2010.02.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2161130615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid Heuristic for an Inventory Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for the open vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3523238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring relaxation induced neighborhoods to improve MIP solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new ILP-based refinement heuristic for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and efficient tabu search heuristic for solving the open vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighbourhood search algorithm for the open vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new tabu search heuristic for the open vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The open vehicle routing problem: algorithms, large-scale test problems, and computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general heuristic for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New dynamic programming algorithms for the resource constrained elementary shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic method for the open vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combination of geographical information system and efficient routing algorithms for real life distribution operations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold accepting approach to the Open Vehicle Routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank

Latest revision as of 04:34, 3 July 2024

scientific article
Language Label Description Also known as
English
An ILP improvement procedure for the open vehicle routing problem
scientific article

    Statements

    An ILP improvement procedure for the open vehicle routing problem (English)
    0 references
    0 references
    0 references
    0 references
    7 September 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    integer linear programming
    0 references
    local search
    0 references
    heuristics
    0 references
    open vehicle routing problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references