Pages that link to "Item:Q4000529"
From MaRDI portal
The following pages link to A polynomial time algorithm for finding the absolute center of a network (Q4000529):
Displaying 9 items.
- An \(O(mn)\) algorithm for the anti-cent-dian problem (Q864778) (← links)
- The absolute center of a unicyclic network (Q908837) (← links)
- An algorithm for finding the absolute center of a network (Q1173797) (← links)
- Some new algorithms for location problems on networks (Q1291656) (← links)
- Location and layout planning. A survey (Q1372765) (← links)
- The biobjective absolute center problem (Q1383313) (← links)
- Biobjective center – balance graph location model<sup>*</sup> (Q4265519) (← links)
- The absolute center of a network (Q4458724) (← links)
- Discrete Center Problems (Q5506720) (← links)