Lower and upper bounds for the mixed capacitated arc routing problem (Q2496039): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q622137
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: José-Manuel Belenguer / 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.1016/j.cor.2005.02.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078408696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fleet size and mix problem for capacitated arc routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350080 / 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: Q2770548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive memetic algorithms for arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guided local search heuristic for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for the mixed Chinese postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixed general routing polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4762468 / 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: The Directed Rural Postman Problem with Turn Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated Arc Routing Problem: Lower bounds / rank
 
Normal rank

Latest revision as of 16:48, 24 June 2024

scientific article
Language Label Description Also known as
English
Lower and upper bounds for the mixed capacitated arc routing problem
scientific article

    Statements

    Lower and upper bounds for the mixed capacitated arc routing problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 June 2006
    0 references
    capacitated arc routing problem
    0 references
    mixed graph
    0 references
    lower bound
    0 references
    cutting plane
    0 references
    heuristic
    0 references
    memetic algorithm
    0 references
    waste collection
    0 references

    Identifiers

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