Approximation hardness of deadline-TSP reoptimization (Q1019743): 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.tcs.2009.02.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2170739645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimizing the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of Minimum and Maximum Traveling Salesman’s Tours / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation Hardness of Some Generalizations of TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterized approximability of TSP with deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of the Metric Deadline TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4377042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of postoptimality analysis of \(0/1\) programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability aspects of the traveling salesman problem based on \(k\)-best solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some concepts of stability analysis in combinatorial optimization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:03, 1 July 2024

scientific article
Language Label Description Also known as
English
Approximation hardness of deadline-TSP reoptimization
scientific article

    Statements

    Approximation hardness of deadline-TSP reoptimization (English)
    0 references
    0 references
    0 references
    28 May 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    TSP with deadlines
    0 references
    reoptimization
    0 references
    inapproximability
    0 references
    0 references