Pages that link to "Item:Q1176800"

The following pages link to Polynomial algorithms to finite Veber problem for a tree network (Q1176800):

Displaying 10 items.

• Algorithm for the discrete Weber's problem with an accuracy estimate (Q329214) (← links)
• Solving a maximin location problem on the plane with given accuracy (Q893922) (← links)
• A method for calculating the optimal variants of surface communication networks at the stage of planning investments into exploitation of an oil deposit. II (Q1287517) (← links)
• Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
• A polynomial algorithm for deciding the validity of an electrical distribution tree (Q2122795) (← links)
• Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree (Q2129757) (← links)
• On the existence of an integer solution to the relaxed Weber problem for a tree network (Q2331474) (← links)
• A polynomial algorithm for thep-centdian problem on a tree (Q4540080) (← links)
• Polynomial algorithms for the synthesis of bounded nets (Q5096743) (← links)
• (Q5150606) (← links)