Local search for the undirected capacitated arc routing problem with profits (Q531469): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 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.1016/j.ejor.2010.09.039 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070401841 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58646223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the prize-collecting rural postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privatized rural postman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undirected capacitated arc routing problem with profits / 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: A heuristic for the multiple tour maximum collection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal solution procedure for the multiple tour maximum collection problem using column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New optimization heuristics. The great deluge algorithm and the record- to-record travel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3343723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The selective travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A path relinking approach for the team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A TABU search heuristic for the team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guided local search metaheuristic for the team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided Local Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries / rank
 
Normal rank

Revision as of 23:44, 3 July 2024

scientific article
Language Label Description Also known as
English
Local search for the undirected capacitated arc routing problem with profits
scientific article

    Statements

    Local search for the undirected capacitated arc routing problem with profits (English)
    0 references
    29 April 2011
    0 references
    arc routing with profits
    0 references
    metaheuristics
    0 references
    local search
    0 references
    aspiration criteria
    0 references

    Identifiers