Pages that link to "Item:Q4004739"
From MaRDI portal
The following pages link to Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints (Q4004739):
Displaying 40 items.
- Survivable network design with shared-protection routing (Q296897) (← links)
- Risk models for the prize collecting Steiner tree problems with interval data (Q403434) (← links)
- Linear bounds for on-line Steiner problems (Q672394) (← links)
- An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445) (← links)
- The box-TDI system associated with 2-edge connected spanning subgraphs (Q1003761) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Directed Steiner problems with connectivity constraints (Q1315992) (← links)
- On the generalized 2-peripatetic salesman problem (Q1328613) (← links)
- On perfectly two-edge connected graphs (Q1363658) (← links)
- A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach (Q1370717) (← links)
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. (Q1430376) (← links)
- New modeling approaches for the design of local access transport area networks (Q1590803) (← links)
- A dynamic programming algorithm for the local access telecommunication network expansion problem (Q1590815) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
- New formulations and solution procedures for the hop constrained network design problem. (Q1810496) (← links)
- Separation of partition inequalities for the \((1,2)\)-survivable network design problem (Q1866009) (← links)
- On two-connected subgraph polytopes (Q1910503) (← links)
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) (← links)
- The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs (Q1917298) (← links)
- Packing Steiner trees: A cutting plane algorithm and computational results (Q1919090) (← links)
- A bootstrap heuristic for designing minimum cost survivable networks (Q1919975) (← links)
- The two-level diameter constrained spanning tree problem (Q2340278) (← links)
- Separation of partition inequalities with terminals (Q2386198) (← links)
- Cutting plane versus compact formulations for uncertain (integer) linear programs (Q2392865) (← links)
- The Steiner connectivity problem (Q2434988) (← links)
- \(k\)-edge connected polyhedra on series-parallel graphs (Q2564304) (← links)
- Critical extreme points of the 2-edge connected spanning subgraph polytope (Q2583127) (← links)
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387) (← links)
- Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
- Box-total dual integrality and edge-connectivity (Q2689821) (← links)
- A metaheuristic for security budget allocation in utility networks (Q2968500) (← links)
- Polyhedral structure of the 4-node network design problem (Q3057114) (← links)
- Reformulation and sampling to solve a stochastic network interdiction problem (Q3184597) (← links)
- On the Steiner 2-edge connected subgraph polytope (Q3598034) (← links)
- Strong Formulations for 2-Node-Connected Steiner Network Problems (Q5505657) (← links)
- On the dominant of the Steiner 2-edge connected subgraph polytope (Q5946813) (← links)
- Steiner trees and polyhedra (Q5946818) (← links)
- Using a hybrid of exact and genetic algorithms to design survivable networks (Q5955471) (← links)
- Design of survivable networks with low connectivity requirements (Q6659118) (← links)
