Hamiltonian location problems (Q1173005): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lagerstandortoptimierung und Fuhrparkeinsatzplanung in der Konsumgüter-Industrie / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Methods for Location-Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / 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: Q5645210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative study of heuristics for a two-level routing-location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4404428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for minimizing routing and operating costs in depot location / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cutting Planes Algorithm for the m-Salesmen Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using cutting planes to solve the symmetric Travelling Salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph / rank
 
Normal rank

Latest revision as of 16:45, 13 June 2024

scientific article
Language Label Description Also known as
English
Hamiltonian location problems
scientific article

    Statements

    Identifiers

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