Improved approximation algorithms for cumulative VRP with stochastic demands (Q2181250): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q130069070, #quickstatements; #temporary_batch_1730405319272
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2018.01.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2793545721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for unequal weight delivery problems with a fixed error guarantee / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Vehicle Routing Problem with Stochastic Demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Truck Dispatching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of recent research on green road freight transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing vehicles to minimize fuel consumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Cumulative VRP with Stochastic Demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cumulative Vehicle Routing Problem: A Column Generation Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for cumulative vehicle routing using column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Approximation Algorithms for VRP with Stochastic Demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds and Heuristics for Capacitated Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energy Minimizing Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Vehicle Routing on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic vehicle routing: A comprehensive approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Development of a fuel consumption optimization model for the capacitated vehicle routing problem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130069070 / rank
 
Normal rank

Latest revision as of 21:08, 31 October 2024

scientific article
Language Label Description Also known as
English
Improved approximation algorithms for cumulative VRP with stochastic demands
scientific article

    Statements

    Improved approximation algorithms for cumulative VRP with stochastic demands (English)
    0 references
    0 references
    0 references
    0 references
    18 May 2020
    0 references
    approximation algorithms
    0 references
    cumulative VRPs
    0 references
    stochastic demand
    0 references
    0 references

    Identifiers