Pages that link to "Item:Q3910336"
From MaRDI portal
The following pages link to Finding minimum rectilinear distance paths in the presence of barriers (Q3910336):
Displaying 30 items.
- Dominance rules for the optimal placement of a finite-size facility in an existing layout (Q337129) (← links)
- On finding a shortest isothetic path and its monotonicity inside a digital object (Q499711) (← links)
- Proximity problems for points on a rectilinear plane with rectangular obstacles (Q675298) (← links)
- On rectilinear link distance (Q808302) (← links)
- Placing a finite size facility with a center objective on a rectangular plane with barriers (Q864036) (← links)
- Finding shortest path in the presence of barriers: an alternate approach (Q870173) (← links)
- Finding rectilinear least cost paths in the presence of convex polygonal congested regions (Q955608) (← links)
- Facility placement with sub-aisle design in an existing layout (Q1011277) (← links)
- Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm) (Q1058966) (← links)
- Mixed planar/network facility location problems (Q1093516) (← links)
- Optimal piecewise linear motion of an object among obstacles (Q1098643) (← links)
- On the accuracy of demand point solutions to the planar, Manhattan metric, p-median problem, with and without barriers to travel (Q1099772) (← links)
- Rectilinear shortest paths in the presence of rectangular barriers (Q1109046) (← links)
- \(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116) (← links)
- Parallel rectilinear shortest paths with rectangular obstacles (Q1190293) (← links)
- An efficient algorithm for facility location in the presence of forbidden regions (Q1266516) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- Rectilinear short path queries among rectangular obstacles (Q1351630) (← links)
- Removing edge-node intersections in drawings of graphs (Q1603534) (← links)
- Rectilinear distance to a facility in the presence of a square barrier (Q1761830) (← links)
- Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm (Q2165800) (← links)
- A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric (Q2267315) (← links)
- Computation of arc length in the presence of barriers in networks (Q2369184) (← links)
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865) (← links)
- Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
- ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS (Q4682161) (← links)
- Spatial Distribution of Traffic Flow in a Rectangular City with a Grid Network and a Rectangular Barrier (Q5039041) (← links)
- Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric (Q5056105) (← links)
- Supply facility and input/output point locations in the presence of barriers (Q5959390) (← links)
- Applications of a numbering scheme for polygonal obstacles in the plane (Q6487421) (← links)
