Pages that link to "Item:Q3202133"
From MaRDI portal
The following pages link to Optimal location of a path or tree on a network with cycles (Q3202133):
Displaying 23 items.
- Approximating the tree and tour covers of a graph (Q688437) (← links)
- Two paths location of a tree with positive or negative weights (Q896109) (← links)
- Comparing different metaheuristic approaches for the median path problem with bounded length (Q928015) (← links)
- A review of extensive facility location in networks (Q1278421) (← links)
- Location of paths on trees with minimal eccentricity and superior section (Q1284599) (← links)
- A unifying location model on tree graphs based on submodularity property (Q1314341) (← links)
- Finding the \(\ell\)-core of a tree (Q1348250) (← links)
- Efficient location of resources in cylindrical networks (Q1646261) (← links)
- Extensive facility location problems on networks: an updated review (Q1667394) (← links)
- Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
- Locating median cycles in networks (Q1887911) (← links)
- Reliability problems in multiple path-shaped facility location on networks (Q2339811) (← links)
- The location of median paths on grid graphs (Q2480201) (← links)
- A branch-and-cut algorithm for the median-path problem (Q2490367) (← links)
- A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs (Q2782732) (← links)
- Two Paths Location of a Tree with Positive or Negative Weights (Q2942409) (← links)
- Locating median paths on connected outerplanar graphs (Q3008924) (← links)
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems (Q3766845) (← links)
- The capacitated m two node survivable star problem (Q4987700) (← links)
- (Q5149013) (← links)
- On fixed-parameter solvability of the minimax path location problem (Q6063573) (← links)
- Finding the most degree-central walks and paths in a graph: exact and heuristic approaches (Q6167664) (← links)
- The biobjective minimum-cost perfect matching problem and Chinese postman problem (Q6495384) (← links)