The traveling salesman problem with flexible coloring (Q444446): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Routing heuristics for automated pick and place machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted delivery problems on a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5850736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Christofides' heuristic: some paths are more difficult than cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3693290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimum execution order of queries in linear storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of the clustered travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probability path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple Order Pick Sequencing in a Carousel System: A Solvable Case of the Rural Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An emergency vehicle dispatching system for an electric utility in Chile / rank
 
Normal rank

Latest revision as of 14:08, 5 July 2024

scientific article
Language Label Description Also known as
English
The traveling salesman problem with flexible coloring
scientific article

    Statements

    The traveling salesman problem with flexible coloring (English)
    0 references
    0 references
    0 references
    0 references
    14 August 2012
    0 references
    0 references
    traveling salesman problem
    0 references
    complexity
    0 references
    heuristics
    0 references
    probabilistic analysis
    0 references
    error bounds
    0 references
    0 references