A variable neighborhood search for the capacitated arc routing problem with intermediate facilities (Q953311): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10732-007-9050-2 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075691918 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59195732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact methods based on node-routing formulations for undirected arc-routing problems / 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: A cutting plane algorithm for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and upper bounds for the mixed capacitated arc routing problem / 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 deterministic tabu search algorithm for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scatter search for the periodic capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4510100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routeing winter gritting vehicles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / 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: A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287166 / 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: Evolutionary algorithms for periodic arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling periodic customer visits for a traveling salesperson / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows / 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: An approximate procedure for determining the number, capacities and locations of solid waste transfer-stations in an urban region / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bound for the capacitated arc routing problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10732-007-9050-2 / rank
 
Normal rank

Latest revision as of 09:40, 10 December 2024

scientific article
Language Label Description Also known as
English
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
scientific article

    Statements

    A variable neighborhood search for the capacitated arc routing problem with intermediate facilities (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 November 2008
    0 references
    capacitated arc routing problem
    0 references
    variable neighborhood search
    0 references
    intermediate facilities
    0 references
    tour length restriction
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers