Solution of real-world postman problems (Q2482818): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Concorde / 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.ejor.2007.06.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966045773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study / 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: Q4762472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding minimum routes in a network with turn penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving arc routing problems with turn penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP heuristic for the mixed Chinese postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4510100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing Problems, Part I: The Chinese Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast local search algorithms for the handicapped persons transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction heuristics for the asymmetric TSP. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the windy postman problem / 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 Note on Postman Problems with Zigzag Service / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential search and its application to vehicle-routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming asymmetric into symmetric traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-step Markov chains for the TSP incorporating local search heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Chinese Postman Problem for Mixed Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of edge traversing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of a linear time algorithm for certain generalized traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3801316 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:12, 27 June 2024

scientific article
Language Label Description Also known as
English
Solution of real-world postman problems
scientific article

    Statements

    Solution of real-world postman problems (English)
    0 references
    0 references
    24 April 2008
    0 references
    0 references
    postman problems
    0 references
    arc-routing
    0 references
    transformation into TSP
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references