The discrete time window assignment vehicle routing problem (Q319363): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CVRPSEP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVRPSP / 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.2015.01.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023470442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reoptimization algorithm for the shortest path problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows / 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: A Suggested Computation for Maximal Multi-Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shortest-Path Problem with Resource Constraints and <i>k</i>-Cycle Elimination for <i>k</i> ≥ 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column Generation based Primal Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Path Cuts for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-price-and-cut algorithm for the workover rig routing problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:39, 12 July 2024

scientific article
Language Label Description Also known as
English
The discrete time window assignment vehicle routing problem
scientific article

    Statements

    The discrete time window assignment vehicle routing problem (English)
    0 references
    0 references
    0 references
    6 October 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    vehicle routing
    0 references
    time window assignment
    0 references
    column generation
    0 references
    uncertain demand
    0 references
    0 references
    0 references
    0 references