Pages that link to "Item:Q2583716"
From MaRDI portal
The following pages link to Locating two obnoxious facilities using the weighted maximin criterion (Q2583716):
Displaying 11 items.
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
- Maximizing the number of obnoxious facilities to locate within a bounded region (Q733537) (← links)
- Solving a maximin location problem on the plane with given accuracy (Q893922) (← links)
- On the remoteness function in median graphs (Q967439) (← links)
- On the ordered anti-Weber problem for any norm in \(\mathbb R^2\) (Q969512) (← links)
- Efficiency for continuous facility location problems with attraction and repulsion (Q1026586) (← links)
- Optimal placement of rectangles on a plane with fixed objects (Q1687016) (← links)
- Computing median and antimedian sets in median graphs (Q2379917) (← links)
- Review of obnoxious facilities location problems (Q2669654) (← links)
- Simultaneous embeddings of graphs as median and antimedian subgraphs (Q3057170) (← links)
- A branch-and-bound method for absolute value programs (Q5413887) (← links)
