Solving survivable two-layer network design problems by metric inequalities (Q429456): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C57 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6048059 / rank
 
Normal rank
Property / zbMATH Keywords
 
optical network design
Property / zbMATH Keywords: optical network design / rank
 
Normal rank
Property / zbMATH Keywords
 
capacity formulation
Property / zbMATH Keywords: capacity formulation / rank
 
Normal rank
Property / zbMATH Keywords
 
metric inequalities
Property / zbMATH Keywords: metric inequalities / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SNDlib / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1986884630 / 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: Design of survivable IP-over-optical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders, metric and cutset inequalities for multicommodity capacitated network design / 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: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-semi-metrics, oriented multi-cuts and related polyhedra / 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: Design of Survivable Networks: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-layered network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight LP‐based lower bounds for wavelength conversion in optical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial approaches to multiflow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach to multicommodity survivable network design / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:33, 5 July 2024

scientific article
Language Label Description Also known as
English
Solving survivable two-layer network design problems by metric inequalities
scientific article

    Statements

    Solving survivable two-layer network design problems by metric inequalities (English)
    0 references
    0 references
    19 June 2012
    0 references
    0 references
    optical network design
    0 references
    capacity formulation
    0 references
    metric inequalities
    0 references
    0 references