Pages that link to "Item:Q689117"
From MaRDI portal
The following pages link to Survivable networks, linear programming relaxations and the parsimonious property (Q689117):
Displaying 44 items.
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- Deterministic sampling algorithms for network design (Q547282) (← links)
- The directed orienteering problem (Q547309) (← links)
- 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem (Q691417) (← links)
- The indefinite period traveling salesman problem (Q724039) (← links)
- Network design with edge-connectivity and degree constraints (Q839639) (← links)
- On the graphical relaxation of the symmetric traveling salesman polytope (Q877195) (← links)
- On the integrality ratio for tree augmentation (Q1003482) (← links)
- A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem (Q1026674) (← links)
- Analysis of the Held-Karp lower bound for the asymmetric TSP (Q1200770) (← links)
- An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
- An improved approximation ratio for the minimum latency problem (Q1290636) (← links)
- A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
- On perfectly two-edge connected graphs (Q1363658) (← links)
- The parsimonious property of cut covering problems and its applications (Q1375118) (← links)
- Generalized spanning trees (Q1579496) (← links)
- Approximation algorithms for connected graph factors of minimum weight (Q1743127) (← links)
- On survivable network polyhedra (Q1772416) (← links)
- On the core of traveling salesman games (Q1785381) (← links)
- On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem (Q1789587) (← links)
- Separation of partition inequalities for the \((1,2)\)-survivable network design problem (Q1866009) (← links)
- A primal-dual approximation algorithm for generalized Steiner network problems (Q1900190) (← links)
- Shorter tours and longer detours: uniform covers and a bit beyond (Q2220659) (← links)
- Computing a tree having a small vertex cover (Q2272400) (← links)
- Resilient layout, design and operation of energy-efficient water distribution networks for high-rise buildings using MINLP (Q2331363) (← links)
- On the facial structure of symmetric and graphical traveling salesman polyhedra (Q2339807) (← links)
- Relay placement for two-connectivity (Q2339829) (← links)
- Problems of synthesis of connected networks with respect to isomorphic subgraphs (Q2574245) (← links)
- A Survey on Covering Supermodular Functions (Q2971606) (← links)
- Approximation algorithms for metric tree cover and generalized tour and tree covers (Q3004205) (← links)
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements (Q3602838) (← links)
- Approaches to the Steiner Problem in Networks (Q3637313) (← links)
- A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case (Q5096584) (← links)
- Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem (Q5206234) (← links)
- Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location (Q5459999) (← links)
- (Q5743492) (← links)
- (Q5881545) (← links)
- Steiner trees and polyhedra (Q5946818) (← links)
- A comparison of Steiner tree relaxations (Q5946825) (← links)
- Improved algorithms for the Steiner problem in networks (Q5946826) (← links)
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems (Q5952066) (← links)
- Robust capacitated Steiner trees and networks with uniform demands (Q6179720) (← links)
- Design of survivable networks with low connectivity requirements (Q6659118) (← links)
