The Generalized Regenerator Location Problem (Q3466768): Difference between revisions

From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710541407615
Import241208061232 (talk | contribs)
Normalize DOI.
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1287/ijoc.2014.0621 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/ijoc.2014.0621 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020049604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The regenerator location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On implementing the push-relabel method for the maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal spanning trees with a constraint on the number of leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulations and solution algorithms for the maximum leaf spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online regenerator placement / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/IJOC.2014.0621 / rank
 
Normal rank

Revision as of 09:01, 21 December 2024

scientific article
Language Label Description Also known as
English
The Generalized Regenerator Location Problem
scientific article

    Statements

    The Generalized Regenerator Location Problem (English)
    0 references
    0 references
    0 references
    0 references
    25 January 2016
    0 references
    optical network design
    0 references
    extended formulations
    0 references
    multicommodity flow
    0 references
    branch and cut
    0 references
    heuristics regenerator location
    0 references

    Identifiers

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