Pages that link to "Item:Q3993630"
From MaRDI portal
The following pages link to The generalized <i>P</i>‐forest problem on a tree network (Q3993630):
Displaying 16 items.
- The \(p\)-hub center allocation problem (Q852943) (← links)
- Finding the conditional location of a median path on a tree (Q937298) (← links)
- Polynomial algorithms to finite Veber problem for a tree network (Q1176800) (← links)
- A review of extensive facility location in networks (Q1278421) (← links)
- The centdian subtree on tree networks (Q1602695) (← 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)
- Location routing problems on trees (Q1735670) (← links)
- Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees (Q1942273) (← links)
- Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← links)
- An effective modeling and solution approach for the generalized independent set problem (Q2458909) (← links)
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs (Q2564302) (← links)
- Minimax regret path location on trees (Q3100694) (← links)
- On a tree-shaped facility location problem of Minieka (Q4021818) (← links)
