The k edge-disjoint 3-hop-constrained paths polytope
From MaRDI portal
Recommendations
- Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
- On the \(k\) edge-disjoint 2-hop-constrained paths polytope
- Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem
- Notes on polyhedra associated with hop-constrained paths
- Integer programming formulations for the two 4-hop-constrained paths problem
Cites work
- scientific article; zbMATH DE number 176255 (Why is no real title available?)
- scientific article; zbMATH DE number 776078 (Why is no real title available?)
- scientific article; zbMATH DE number 2196281 (Why is no real title available?)
- A branch-and-cut algorithm for the \(k\)-edge connected subgraph problem
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
- A note on hop-constrained walk polytopes.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Critical extreme points of the 2-edge connected spanning subgraph polytope
- Design of Survivable Networks: A survey
- Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
- Hop-constrained node survivable network design: An application to MPLS over WDM
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- Integer programming formulations for the two 4-hop-constrained paths problem
- Notes on polyhedra associated with hop-constrained paths
- On the \(k\) edge-disjoint 2-hop-constrained paths polytope
- On the directed hop-constrained shortest path problem
- On two-connected subgraph polytopes
- Solving the Two-Connected Network with Bounded Meshes Problem
- Steiner \(k\)-edge connected subgraph polyhedra
- The 2-hop spanning tree problem
- The 2-path network problem
- The k-Edge-Connected Spanning Subgraph Polyhedron
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
- The traveling salesman problem on a graph and some related integer polyhedra
- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
- Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
- \(k\)-edge connected polyhedra on series-parallel graphs
Cited in
(16)- Robustness and strong attack tolerance of low-diameter networks
- Hop-level flow formulation for the survivable network design with hop constraints problem
- On the chance-constrained minimum spanning \(k\)-core problem
- Distance transformation for network design problems
- A polyhedral study of the diameter constrained minimum spanning tree problem
- Length 3 edge-disjoint paths is NP-hard
- Trade-offs among degree, diameter, and number of paths
- Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
- Composition of graphs and the hop-constrained path problem
- Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem
- Layered graph approaches for combinatorial optimization problems
- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks
- A complete characterization of jump inequalities for the hop-constrained shortest path problem
- On the number of edges in a graph with many two-hop disjoint paths
- On the \(k\) edge-disjoint 2-hop-constrained paths polytope
- Integer programming formulations for the two 4-hop-constrained paths problem
This page was built for publication: The \(k\) edge-disjoint 3-hop-constrained paths polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429666)
