Incremental network design with shortest paths (Q296857): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q57955347, #quickstatements; #temporary_batch_1722243545156
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Savelsbergh, Martin W. P. / rank
Normal rank
 
Property / author
 
Property / author: Savelsbergh, Martin W. P. / 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.1016/j.ejor.2014.04.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991615243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergency path restoration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Network Design with Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization procedures in shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient recovery from power outage (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler and better approximation algorithms for network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of Survivable Networks: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approach for Incremental Approximation and Hierarchical Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategic network restoration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Online Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbital branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for reoptimizing shortest paths when the arc costs change / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57955347 / rank
 
Normal rank

Latest revision as of 10:59, 29 July 2024

scientific article
Language Label Description Also known as
English
Incremental network design with shortest paths
scientific article

    Statements

    Incremental network design with shortest paths (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 June 2016
    0 references
    network design
    0 references
    multi-period
    0 references
    heuristic
    0 references
    approximation algorithm
    0 references
    integer programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references