Pages that link to "Item:Q3039008"

The following pages link to Computing largest empty circles with location constraints (Q3039008):

Displaying 22 items.

• Local calculation of Voronoi diagrams (Q293475) (← links)
• Approximating generalized distance functions on weighted triangulated surfaces with applications (Q425342) (← links)
• Planar expropriation problem with non-rigid rectangular facilities (Q709112) (← links)
• On finding a widest empty 1-corner corridor (Q844199) (← links)
• Largest empty circle centered on a query line (Q972354) (← links)
• Computing circular separability (Q1079817) (← links)
• An O\((n \log{}n)\) algorithm for a maxmin location problem (Q1192955) (← links)
• Locational optimization problems solved through Voronoi diagrams (Q1278720) (← links)
• A bird's eye-view of min-max and max-min functionals (Q1362232) (← links)
• Computing an obnoxious anchored segment. (Q1413920) (← links)
• A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty (Q1634054) (← links)
• Undesirable facility location with minimal covering objectives (Q1806769) (← links)
• The generalized yolk point (Q1975323) (← links)
• On finding widest empty curved corridors (Q2385694) (← links)
• Locating an obnoxious plane (Q2496077) (← links)
• Computing obnoxious 1-corner polygonal chains (Q2571197) (← links)
• Locating two obnoxious facilities using the weighted maximin criterion (Q2583716) (← links)
• On Computing a Largest Empty Arbitrarily Oriented Rectangle (Q4818583) (← links)
• THE LARGEST EMPTY ANNULUS PROBLEM (Q4818587) (← links)
• On the Computational Complexity of Linear Discrepancy (Q5874541) (← links)
• Maximum-width empty square and rectangular annulus (Q5918102) (← links)
• The obnoxious facility location game with dichotomous preferences (Q6039896) (← links)