The traveling salesman problem with few inner points (Q2583717): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1016/j.orl.2005.01.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2111090561 / 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: The prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Treatment of the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Convex-hull-and-k-line Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The searching over separators strategy to solve some NP-hard problems in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euclidean traveling salesman problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:23, 11 June 2024

scientific article
Language Label Description Also known as
English
The traveling salesman problem with few inner points
scientific article

    Statements

    The traveling salesman problem with few inner points (English)
    0 references
    0 references
    18 January 2006
    0 references
    0 references
    exact algorithm
    0 references
    fixed-parameter algorithm
    0 references
    parameterization
    0 references
    traveling salesman
    0 references
    0 references