Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (Q6130323): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-023-01187-z / rank
Normal rank
 
Property / cites work
 
Property / cites work: A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for minimum and min-max vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-Max <i>K</i> -vehicles windy rural postman 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: Arc Routing Problems, Part I: The Chinese Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Some Postman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security routing games with multivehicle Chinese postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On general routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fundamental problem in vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of edge traversing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3/2-Approximation Algorithm for the Mixed Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronized arc routing for snow plowing operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for some min-max and minimum stacker crane cover problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5271449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation hardness of min-max tree covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better approximability results for min-max tree/cycle/path cover problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for some min-max postmen cover problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-023-01187-Z / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:43, 30 December 2024

scientific article; zbMATH DE number 7826814
Language Label Description Also known as
English
Approximation algorithms for the min-max mixed rural postmen cover problem and its variants
scientific article; zbMATH DE number 7826814

    Statements

    Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 April 2024
    0 references
    approximation algorithm
    0 references
    mixed Chinese postman problem
    0 references
    mixed rural postman problem
    0 references
    stacker crane problem
    0 references
    postmen cover
    0 references
    0 references
    0 references

    Identifiers