Locating a cycle in a transportation or a telecommunications network (Q3593375): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1002/net.20170 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4250150436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / 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: State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for the Orienteering Tour Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank

Latest revision as of 11:37, 26 June 2024

scientific article
Language Label Description Also known as
English
Locating a cycle in a transportation or a telecommunications network
scientific article

    Statements

    Locating a cycle in a transportation or a telecommunications network (English)
    0 references
    0 references
    20 July 2007
    0 references
    cycle location
    0 references
    transportation
    0 references
    telecommunications
    0 references
    traveling salesman problem
    0 references
    Hamiltonian cycles
    0 references
    branch-and-cut
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references

    Identifiers

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