The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem (Q296774): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / 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: An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5271456 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated Arc Routing Problem: Lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional divide-and-conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guided local search heuristic for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated label setting algorithms for the elementary resource constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent results on Arc Routing Problems: An annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955266 / 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: Q4510100 / 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: The travelling salesman problem as a constrained shortest path problem: Theory and computational experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource extension functions: properties, inversion, and generalization to segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Path Problems with Resource Constraints / 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: 2-Path Cuts for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting sparsity in pricing routines for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pricing routines for vehicle routing with time windows on road networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A capacitated general routing problem on mixed networks / 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

Latest revision as of 06:10, 12 July 2024

scientific article
Language Label Description Also known as
English
The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
scientific article

    Statements

    The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem (English)
    0 references
    0 references
    0 references
    23 June 2016
    0 references
    constrained shortest paths
    0 references
    cycle elimination
    0 references
    capacitated arc-routing problem
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers