What people are saying - Write a review
We haven't found any reviews in the usual places.
The Crosscut Algorithm for Approximate Solutions
4 other sections not shown
active nodes algorithm of Section analysis approximate algorithm assigned to Source associated sink best solution branch-and-bound algorithm branching sink CALL Cartesian cc cc cc circle distances COBBON combinatorial computational experience contiguous United convergence Convex Hulls Cooper cost of optimally DIST Euclidean feasible solution global minimum IBRAN IFEAS Illustrative Example initial sources iteration KTOP Kuenne l2 Kuhn and Kuenne latitude and longitude map distance Mercator projection metric option metropolitan metric minimum solutions multisource Weber problem MULTIWEB nautical miles NODIB objective function values optimal solution optimally locating partitioned PHIN(I PHIO point sink-point source RETURN BW2 rhumb line distance single-source algorithm single-source Weber problem sink clusters SINK LOCATIONS sink weights sink-area source sinks assigned sinks to sources Solution to Date spatial subroutine subset Table tentatively located sources unassigned sink underestimate the cost Urban Area Centering Weber point problems WRITE WRITF XNOR