A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2005.02.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2115114028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel iterative search methods for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symmetric traveling salesman problem and edge exchanges in minimal 1- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic diversification and intensification in local search for vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Granular Tabu Search and Its Application to the Vehicle-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>m</i>-Traveling Salesman Problem with Minmax Objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive memory heuristic for a class of vehicle routing problems with minmax objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routeing winter gritting vehicles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4836312 / 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: Improvement Procedures for the Undirected Rural Postman 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: Variable neighborhood search / 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: Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On general routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching, Euler tours and the Chinese postman / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach to the rural postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the general routing problem / 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
A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
scientific article

    Statements

    A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (English)
    0 references
    0 references
    0 references
    30 June 2006
    0 references
    arc routing
    0 references
    Chinese postman problem
    0 references
    tabu search
    0 references
    min-max optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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