Min-Max <i>K</i> -vehicles windy rural postman problem (Q3057121): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
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.1002/net.20334 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4234983472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3159349 / 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: The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cycle polytope of a binary matroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated arc routing problem: Valid inequalities and facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds and heuristics for the windy rural postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the Rural Postman problem on a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch &amp; cut algorithm for the windy general routing problem and special cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing Problems, Part II: The Rural Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the undirected rural postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solvable cases of the \(k\)-person Chinese postman problem / rank
 
Normal rank

Revision as of 11:58, 3 July 2024

scientific article
Language Label Description Also known as
English
Min-Max <i>K</i> -vehicles windy rural postman problem
scientific article

    Statements

    Min-Max <i>K</i> -vehicles windy rural postman problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 November 2010
    0 references
    facets
    0 references
    multivehicles
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references