An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance (Q1670106): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10957-018-1221-9 / 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/s10957-018-1221-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2787763202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse combinatorial optimization: a survey on problems, methods, and results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an instance of the inverse shortest paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation method for inverse shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the reverse shortest-path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted inverse minimum spanning tree problems under Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some inverse optimization problems under the Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse 1-median problem on trees under weighted Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse minimum cost flow problems under the weighted Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse min-max spanning tree problem under the weighted sum-type Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: The center location improvement problem under the Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest path improvement problems under Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3466912 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10957-018-1221-9 / rank
 
Normal rank

Latest revision as of 02:09, 11 December 2024

scientific article
Language Label Description Also known as
English
An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance
scientific article

    Statements

    An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 September 2018
    0 references
    shortest path problem
    0 references
    rooted trees
    0 references
    network improvement problem
    0 references
    Hamming distance
    0 references
    dynamic programming
    0 references

    Identifiers