Route relaxations on GPU for vehicle routing problems (Q1751660): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): journals/eor/BoschettiMS17, #quickstatements; #temporary_batch_1731475607626
 
(One intermediate revision by one other user not shown)
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: A set covering based matheuristic for a real‐world city logistics problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving knapsack problems on GPU / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving path problems on the GPU / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-space relaxation procedures for the computation of bounds to routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Truck Dispatching Problem / 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: Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW / 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: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem. Latest advances and new challenges. / 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: Very large-scale vehicle routing: new test problems, algorithms, and results / 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: Efficient elementary and restricted non-elementary route pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints / 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: Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/eor/BoschettiMS17 / rank
 
Normal rank

Latest revision as of 06:47, 13 November 2024

scientific article
Language Label Description Also known as
English
Route relaxations on GPU for vehicle routing problems
scientific article

    Statements

    Route relaxations on GPU for vehicle routing problems (English)
    0 references
    25 May 2018
    0 references
    dynamic programming
    0 references
    route relaxation
    0 references
    parallel algorithms
    0 references
    GPU computing
    0 references
    CUDA
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers