Pages that link to "Item:Q1872030"
From MaRDI portal
The following pages link to Solving rectilinear planar location problems with barriers by a polynomial partitioning (Q1872030):
Displaying 10 items.
- Continuous location model of a rectangular barrier facility (Q526636) (← links)
- A wavefront approach to center location problems with barriers (Q816405) (← links)
- Planar location problems with block distance and barriers (Q816413) (← links)
- Placing a finite size facility with a center objective on a rectangular plane with barriers (Q864036) (← links)
- The rectilinear distance Weber problem in the presence of a probabilistic line barrier (Q1038385) (← links)
- Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints (Q1284596) (← links)
- Algebraic properties of location problems with one circular barrier. (Q1420408) (← links)
- Rectilinear distance to a facility in the presence of a square barrier (Q1761830) (← links)
- An equivalence result for single facility planar location problems with rectilinear distance and barriers (Q1872029) (← links)
- A reduction result for location problems with polyhedral barriers (Q5937710) (← links)