Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model (Q635160): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: José M. Valério de Carvalho / rank
Normal rank
 
Property / author
 
Property / author: José M. Valério de Carvalho / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: VRP / 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.1016/j.ejor.2011.04.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982862520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for a single-vehicle routing problem with time windows and multiple routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-trip vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3523238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Truck Dispatching Problem / 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: 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: Adaptive memory programming for the vehicle routing problem with multiple trips / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GA based heuristic for the vehicle routing problem with multiple trips / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routeing with Multiple Use of Vehicles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank

Latest revision as of 10:22, 4 July 2024

scientific article
Language Label Description Also known as
English
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
scientific article

    Statements

    Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 August 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    integer programming
    0 references
    combinatorial optimization
    0 references
    routing
    0 references
    network flows
    0 references
    0 references