The capacitated arc routing problem with refill points (Q2643817): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The capacitated arc routing problem: Valid inequalities and facets / 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: Q4510100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4762467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated arc routing problem with intermediate facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian location problems / 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: A Tabu Search Heuristic for the Capacitated arc Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4367082 / rank
 
Normal rank

Latest revision as of 13:19, 26 June 2024

scientific article
Language Label Description Also known as
English
The capacitated arc routing problem with refill points
scientific article

    Statements

    The capacitated arc routing problem with refill points (English)
    0 references
    0 references
    0 references
    0 references
    27 August 2007
    0 references
    multi-trip rural postman problem
    0 references
    capacitated arc routing problem
    0 references
    replenishment points
    0 references
    integer linear model
    0 references
    road marking
    0 references

    Identifiers