On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (Q464901): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q334237
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10559-011-9319-1 / rank
Normal rank
 
Property / author
 
Property / author: Victor A. Mikhailyuk / rank
 
Normal rank
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.1007/s10559-011-9319-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027146650 / 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: Q2867366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimizing the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non deterministic polynomial optimization problems and their approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling under Precedence Constraints / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10559-011-9319-1 / rank
 
Normal rank

Latest revision as of 18:20, 9 December 2024

scientific article
Language Label Description Also known as
English
On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems
scientific article

    Statements

    On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (English)
    0 references
    30 October 2014
    0 references
    reoptimization
    0 references
    \(r\)-approximation algorithm
    0 references
    polynomial-time approximation scheme
    0 references

    Identifiers