Lateness Minimization in Pairwise Connectivity Restoration Problems (Q5136078): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q129247718, #quickstatements; #temporary_batch_1723924200075
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/ijoc.2017.0796 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2891737621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergency path restoration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan in multiserver network restoration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network construction problems with due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental network design with shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: An SST-based algorithm for the steiner problem in graphs / 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: Q4198056 / 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: Incremental network design with maximum flows / 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: An algorithm for the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time indexed formulation of non-preemptive single machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129247718 / rank
 
Normal rank

Latest revision as of 21:21, 17 August 2024

scientific article; zbMATH DE number 7277779
Language Label Description Also known as
English
Lateness Minimization in Pairwise Connectivity Restoration Problems
scientific article; zbMATH DE number 7277779

    Statements

    Lateness Minimization in Pairwise Connectivity Restoration Problems (English)
    0 references
    0 references
    0 references
    25 November 2020
    0 references
    combinatorial optimization
    0 references
    networks
    0 references
    branch and bound
    0 references
    network restoration
    0 references
    network construction
    0 references
    integrated network design
    0 references
    scheduling
    0 references

    Identifiers

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