The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation
From MaRDI portal
Recommendations
- On the linear relaxation of the 2-node connected subgraph polytope
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- scientific article; zbMATH DE number 7310218
- A Lagrangian relaxation approach to the edge-weighted clique problem
- The k-node connected subgraph problem: polyhedral analysis and branch-and-cut
- scientific article; zbMATH DE number 1187146
- Node and edge relaxations of the max-cut problem
- Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
- The rooted maximum node-weight connected subgraph problem
Cites work
- A note on the prize collecting traveling salesman problem
- Design of survivable networks
- Generalized steiner problem in series-parallel networks
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- Minimum-weight two-connected spanning networks
- On two-connected subgraph polytopes
- Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs
- The Steiner tree polytope and related polyhedra
- The ellipsoid method and its consequences in combinatorial optimization
- Two-edge connected spanning subgraphs and polyhedra
This page was built for publication: The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2506819)
