Pages that link to "Item:Q1122367"
From MaRDI portal
The following pages link to A study on two geometric location problems (Q1122367):
Displaying 21 items.
- Representation of the non-dominated set in biobjective discrete optimization (Q342058) (← links)
- Theory and application of width bounded geometric separators (Q632801) (← links)
- Integer-friendly formulations for the \(r\)-separation problem (Q1268268) (← links)
- Hierarchically specified unit disk graphs (Q1269904) (← links)
- On the complexity of two circle connecting problems (Q1314320) (← links)
- A comparison of \(p\)-dispersion heuristics (Q1342949) (← links)
- Maximum independent set and maximum clique algorithms for overlap graphs (Q1408815) (← links)
- Dispersing points on intervals (Q1706121) (← links)
- Dispersing and grouping points on planar segments (Q2232600) (← links)
- On the intersection graph of the disks with diameters the sides of a convex \(n\)-gon (Q2245950) (← links)
- Facility location with tree topology and radial distance constraints (Q2280295) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- Faster approximation for maximum independent set on unit disk graph (Q2398507) (← links)
- Maximizing single attribute diversity in group selection (Q2678607) (← links)
- Parameterized study of Steiner tree on unit disk graphs (Q2700383) (← links)
- Minimizing Co-location Potential of Moving Entities (Q2829447) (← links)
- Testing Consumer Rationality Using Perfect Graphs and Oriented Discs (Q3460788) (← links)
- (Q5091024) (← links)
- A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM (Q5322316) (← links)
- (Q5875468) (← links)
- Max-min dispersion on a line (Q5918519) (← links)
