Approximation algorithms for solving the heterogeneous Chinese postman problem (Q2106868): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-022-00931-5 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: VRP / 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.1007/s10878-022-00931-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4310080440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for a two depot heterogeneous traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of a new heuristic for the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching, Euler tours and the Chinese postman / 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: Capacitated Vehicle Routing with Nonuniform Speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519709 / 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: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for solving the heterogeneous Chinese postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-Max Tours and Paths for Task Allocation to Heterogeneous Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-022-00931-5 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:07, 17 December 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for solving the heterogeneous Chinese postman problem
scientific article

    Statements

    Approximation algorithms for solving the heterogeneous Chinese postman problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 November 2022
    0 references
    combinatorial optimization
    0 references
    nonuniform speeds
    0 references
    heterogeneous Chinese postman tours
    0 references
    approximation algorithms
    0 references

    Identifiers