Pages that link to "Item:Q3113501"

The following pages link to Big segment small segment global optimization algorithm on networks (Q3113501):

Displaying 10 items.

• Covering part of a planar network (Q291695) (← links)
• The quintile share ratio in location analysis (Q296717) (← links)
• \(p\)-facility Huff location problem on networks (Q323476) (← links)
• Single-facility huff location problems on networks (Q490213) (← links)
• New local searches for solving the multi-source Weber problem (Q512988) (← links)
• The Weber obnoxious facility location model: a big arc small arc approach (Q1651661) (← links)
• Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem (Q1686519) (← links)
• The obnoxious facilities planar \(p\)-median problem (Q2241906) (← links)
• A branch-and-bound approach for estimating covering functionals of convex bodies (Q2696981) (← links)
• An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network (Q6065885) (← links)