Design of survivable networks using three- and four-partition facets
From MaRDI portal
Publication:5301121
Recommendations
Cited in
(16)- Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
- More facets for survivable networks
- scientific article; zbMATH DE number 2196281 (Why is no real title available?)
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- New valid inequalities for the optimal communication spanning tree problem
- A polyhedral approach for solving two facility network design problem
- Optimal relay node placement in delay constrained wireless sensor network design
- Survivable network design with shared-protection routing
- k-Partition-based facets of the network design problem
- Valid inequalities and facets for multi‐module survivable network design problem
- Strong inequalities for capacitated survivable network design problems.
- Network loading problem: valid inequalities from 5- and higher partitions
- Partition inequalities for capacitated survivable network design based on directed p-cycles
- Near optimal design of wavelength routed optical networks
- Fixed charge multicommodity network design using p-partition facets
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
This page was built for publication: Design of survivable networks using three- and four-partition facets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301121)
