Improving the approximation ratio for capacitated vehicle routing (Q5925635): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-022-01841-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3104752286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PTAS FOR k-TOUR COVER PROBLEM ON THE PLANE FOR MODERATELY LARGE VALUES OF k / 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: A new approximation algorithm for the capacitated vehicle routing problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for bounded-capacity vehicle routing in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Orienteering and Discounted-Reward TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The School Bus Problem on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for vehicle routing solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the separation problem for rounded capacity inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact, provably-good LPs for orienteering and regret-bounded vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum-cost graph problems with spanning tree edges / 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: A (slightly) improved approximation algorithm for metric TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: PTAS for the Euclidean Capacitated Vehicle Routing Problem in $$R^d$$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Vehicle Routing on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing All Small Cuts in an Undirected Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some techniques useful for solution of transportation network problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic analysis, linear programming and branch and bound / rank
 
Normal rank

Latest revision as of 16:22, 31 July 2024

scientific article; zbMATH DE number 7662907
Language Label Description Also known as
English
Improving the approximation ratio for capacitated vehicle routing
scientific article; zbMATH DE number 7662907

    Statements

    Improving the approximation ratio for capacitated vehicle routing (English)
    0 references
    0 references
    0 references
    0 references
    14 March 2023
    0 references
    0 references
    0 references
    0 references

    Identifiers