Strong Lower Bounds for a Survivable Network Design Problem (Q2883576): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57705373, #quickstatements; #temporary_batch_1711574657256 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The directed subgraph homeomorphism problem / 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 Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks / rank | |||
Normal rank | |||
Latest revision as of 05:24, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong Lower Bounds for a Survivable Network Design Problem |
scientific article |
Statements
Strong Lower Bounds for a Survivable Network Design Problem (English)
0 references
13 May 2012
0 references
mixed integer programming
0 references
column generation
0 references
survivable network design
0 references
