A polyhedral study of the capacity formulation of the multilayer network design problem (Q5326800): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1002/net.21488 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999253041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-Partition-based facets of the network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On capacitated network design cut-set polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric inequalities and the network loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost capacity installation for multicommodity network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Network Design—Polyhedral Structure and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of survivable IP-over-optical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing Through Virtual Paths in Layered Telecommunication Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved Benders decomposition applied to a multi-layer network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hop-constrained node survivable network design: An application to MPLS over WDM / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for capacitated network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convex hull of two core capacitated network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating tight metric inequalities by bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving survivable two-layer network design problems by metric inequalities / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:10, 6 July 2024

scientific article; zbMATH DE number 6195695
Language Label Description Also known as
English
A polyhedral study of the capacity formulation of the multilayer network design problem
scientific article; zbMATH DE number 6195695

    Statements

    A polyhedral study of the capacity formulation of the multilayer network design problem (English)
    0 references
    0 references
    0 references
    0 references
    6 August 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    multilayer network design
    0 references
    capacity formulation
    0 references
    facets
    0 references
    0 references