Pages that link to "Item:Q1602695"
From MaRDI portal
The following pages link to The centdian subtree on tree networks (Q1602695):
Displaying 34 items.
- On discrete optimization with ordering (Q367635) (← links)
- A note on the nestedness property for ordered median problems in tree networks (Q394466) (← links)
- The connected \(p\)-center problem on block graphs with forbidden vertices (Q418726) (← links)
- Some central subtree problems and applications of a classical technique of deriving the center of a tree (Q600452) (← links)
- Dynamic and static algorithms for optimal placement of resources in a tree (Q671529) (← links)
- Range minimization problems in path-facility location on trees (Q713326) (← links)
- Algorithms for connected \(p\)-centdian problem on block graphs (Q724753) (← links)
- A polynomial algorithm for the multicriteria cent-dian location problem (Q864019) (← links)
- An \(O(mn)\) algorithm for the anti-cent-dian problem (Q864778) (← links)
- Comparing different metaheuristic approaches for the median path problem with bounded length (Q928015) (← links)
- Finding the conditional location of a median path on a tree (Q937298) (← links)
- The 2-radius and 2-radiian problems on trees (Q955029) (← links)
- Extensive facility location problems on networks with equity measures (Q1028434) (← links)
- Optimal algorithms for the path/tree-shaped facility location problems in trees (Q1031869) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- Extensive facility location problems on networks: an updated review (Q1667394) (← links)
- Revisiting \(k\)-sum optimization (Q1675256) (← links)
- Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
- Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
- Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← links)
- An improved algorithm for the minmax regret path center problem on trees (Q2194857) (← links)
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
- On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges (Q2294142) (← links)
- An algorithm for solving the bi-objective median path-shaped facility on a tree network (Q2305157) (← links)
- A note on the subtree ordered median problem in networks based on nestedness property (Q2358843) (← links)
- A linear time algorithm for connected \(p\)-centdian problem on block graphs (Q2672632) (← links)
- The Connected p-Centdian Problem on Block Graphs (Q3467867) (← links)
- The optimal location of a path or tree in a tree network (Q3703613) (← links)
- Medi-Centers of a Tree (Q3755207) (← links)
- From the median to the generalized center (Q3971961) (← links)
- An Optimal Algorithm for Weighted Minimax Flow Centers on Trees (Q3991674) (← links)
- On cent-dians of general networks (Q4228770) (← links)
- The continuous and discrete path‐variance problems on trees (Q5191143) (← links)
- The extensive 1-median problem with radius on networks (Q6091088) (← links)
